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: 92,261

External links

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

Through your library

Similar books and articles

Syntactic Refutations against Finite Models in Modal Logic.Tomasz Skura - 1994 - Notre Dame Journal of Formal Logic 35 (4):595-605.
On extensions of intermediate logics by strong negation.Marcus Kracht - 1998 - Journal of Philosophical Logic 27 (1):49-73.
Finite Tree Property for First-Order Logic with Identity and Functions.Merrie Bergmann - 2005 - Notre Dame Journal of Formal Logic 46 (2):173-180.
The RM paraconsistent refutation system.Tomasz Skura - 2009 - Logic and Logical Philosophy 18 (1):65-70.
Implementing a relational theorem prover for modal logic K.Angel Mora, Emilio Munoz Velasco & Joanna Golińska-Pilarek - 2011 - International Journal of Computer Mathematics 88 (9):1869-1884.
Refutation systems in modal logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
The Logic of Relativism.Mark Ressler - 2013 - Increasingly Skeptical Publications.
What is Negation?Dov M. Gabbay & Heinrich Wansing (eds.) - 1999 - Dordrecht, Netherland: Springer.

Analytics

Added to PP
2023-09-16

Downloads
8 (#1,322,828)

6 months
7 (#439,760)

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