Correspondence Analysis for Some Fragments of Classical Propositional Logic

Logica Universalis 15 (1):67-85 (2021)
  Copy   BIBTEX


In the paper, we apply Kooi and Tamminga’s correspondence analysis to some conventional and functionally incomplete fragments of classical propositional logic. In particular, the paper deals with the implication, disjunction, and negation fragments. Additionally, we consider an application of correspondence analysis to some connectiveless fragment with certain basic properties of the logical consequence relation only. As a result of the application, one obtains a sound and complete natural deduction system for any binary extension of each fragment in question. With the focus on exclusive disjunction we comparatively study the proposed systems. Finally, we discuss Segerberg’s systems for connectiveless and negation fragments and compare them with our systems.



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

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

Complexity of intuitionistic propositional logic and its fragments.Mikhail Rybakov - 2008 - Journal of Applied Non-Classical Logics 18 (2):267-292.
Fragments of R-Mingle.W. J. Blok & J. G. Raftery - 2004 - Studia Logica 78 (1-2):59-106.
On Homogenous Fragments Of Normal Modal Propositional Logics.Jerzy Perzanowski - 1975 - Bulletin of the Section of Logic 4 (2):44-49.
A Binary-conclusion Natural Deduction System.K. Fujita - 1999 - Logic Journal of the IGPL 7 (4):517-545.
Formal systems of fuzzy logic and their fragments.Petr Cintula, Petr Hájek & Rostislav Horčík - 2007 - Annals of Pure and Applied Logic 150 (1-3):40-65.
Natural deduction systems for some non-commutative logics.Norihiro Kamide & Motohiko Mouri - 2007 - Logic and Logical Philosophy 16 (2-3):105-146.


Added to PP

16 (#830,801)

6 months
6 (#349,140)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yaroslav Petrukhin
Moscow State University

Citations of this work

Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - 2023 - Journal of Logic, Language and Information 32 (2):247-273.
Two-sided Sequent Calculi for FDE-like Four-valued Logics.Barteld Kooi & Allard Tamminga - 2023 - Journal of Philosophical Logic 52 (2):495-518.

Add more citations

References found in this work

The logic of paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219 - 241.
A useful four-valued logic.N. D. Belnap - 1977 - In J. M. Dunn & G. Epstein (eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.
How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.

View all 16 references / Add more references