Comments on some completeness theorems of Urquhart and méndez & Salto

&
Journal of Philosophical Logic 30 (1):51-55 (2001)
  Copy   BIBTEX

Abstract

Urquhart and Méndez and Salto claim to establish completeness theorems for the system C and two of its negation extensions. In this note, we do the following three things: (1) provide a counterexample to all of these alleged completeness theorems, (2) attempt to diagnose the mistakes in the reported completeness proofs, and (3) provide complete axiomatizations of the desired systems

Categories

Keywords

Reprint years

2004

DOI

10.1023/a:1017549804474

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 102,873

External links

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

Through your library

My notes

Similar books and articles

Completeness theorems via the double dual functor.Adriana Galli, Marta Sagastume & Gonzalo E. Reyes - 2000 - Studia Logica 64 (1):61-81.
A unified completeness theorem for quantified modal logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
Normal modal substructural logics with strong negation.Norihiro Kamide - 2003 - Journal of Philosophical Logic 32 (6):589-612.
Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic.Norihiro Kamide & Yoni Zohar - 2020 - Studia Logica 108 (3):549-571.
Reductive techniques in proofs of the completeness theorems for the normal bimodal systems.Piotr Lukowski - 2003 - Bulletin of the Section of Logic 32 (3):147-159.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Completeness theorems, representation theorems: what's the difference?David C. Makinson - unknown - Hommage À Wlodek: Philosophical Papers Dedicated to Wlodek Rabinowicz, Ed. Rønnow-Rasmussen Et Al. 2007.
Syntactical results on the arithmetical completeness of modal logic.Paolo Gentilini - 1993 - Studia Logica 52 (4):549 - 564.
Extensions of Makinson's Completeness Theorems in Modal Logic.R. Routley - 1970 - Mathematical Logic Quarterly 16 (3):239-256.
Rules in relevant logic - I: Semantic classification.Ross T. Brady - 1994 - Journal of Philosophical Logic 23 (2):111 - 137.

Analytics

Added to PP
2009-01-28

Downloads
158 (#148,642)

6 months
11 (#298,247)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Branden Fitelson
Northeastern University

Citations of this work

Add more citations

References found in this work

A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.
Many-valued logic.Alasdair Urquhart - 1986 - In D. Gabbay & F. Guenther, Handbook of Philosophical Logic, Vol. Iii. D. Reidel Publishing Co..

Add more references