A method to single out maximal propositional logics with the disjunction property II

Annals of Pure and Applied Logic 76 (2):117-168 (1995)
  Copy   BIBTEX

Abstract

This is the second part of a paper devoted to the study of the maximal intermediate propositional logics with the disjunction property , whose first part has appeared in this journal with the title “A method to single out maximal propositional logics with the disjunction property I”. In the first part we have explained the general results upon which a method to single out maximal constructive logics is based and have illustrated such a method by exhibiting the Kripke semantics of maximal constructive logics extending the logic ST of Scott, for which, in turn, a semantical characterization in terms of Kripke frames has been given. In the present part we complete the illustration of the method of the first part, having in mind some aspects which might be interesting for a classification of the maximal constructive logics, and an application of the heuristic content of the method to detect the nonmaximality of apparently maximal constructive logics. Thus, on the one hand we introduce the logic AST , which is compared with ST and is seen as a logic “alternative” to it, in a sense which will be precisely explained. We provide a Kripke semantics for AST and show that there are maximal constructive logics which neither are extensions of ST nor are extensions of AST. Finally, we give a further application of the results of the first part by exhibiting the Kripke semantics of a maximal constructive logic extending AST. On the other hand, we compare the maximal constructive logics presented in both parts of the paper with a constructive logic introduced by Maksimova , which has been conjectured to be maximal by Chagrov and Zacharyashchev ; from this comparison a disproof of the conjecture arises

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Maximality and Refutability.Tom Skura - 2004 - Notre Dame Journal of Formal Logic 45 (2):65-72.
Metacompleteness of Substructural Logics.Takahiro Seki - 2012 - Studia Logica 100 (6):1175-1199.
An Algebraic Approach to the Disjunction Property of Substructural Logics.Daisuke Souma - 2007 - Notre Dame Journal of Formal Logic 48 (4):489-495.
Logics with disjunction and proof by cases.San-min Wang & Petr Cintula - 2008 - Archive for Mathematical Logic 47 (5):435-446.
A result on propositional logics having the disjunction property.Robert E. Kirk - 1982 - Notre Dame Journal of Formal Logic 23 (1):71-74.

Analytics

Added to PP
2014-01-16

Downloads
18 (#811,325)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?