Finite Tree-Countermodels via Refutation Systems in Extensions of Positive Logic with Strong Negation

Logica Universalis 17 (4):433-441 (2023)
  Copy   BIBTEX

Abstract

A sufficient condition for an extension of positive logic with strong negation to be characterized by a class of finite trees is given.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2023-09-16

Downloads
9 (#1,268,194)

6 months
7 (#592,600)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Connexive Modal Logic.H. Wansing - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 367-383.

Add more references