Cn-definitions of propositional connectives

&
Studia Logica 67 (1):1-26 (2001)
  Copy   BIBTEX

Abstract

We attempt to define the classical propositional logic by use of appropriate derivability conditions called Cn-definitions. The conditions characterize basic properties of propositional connectives.

Categories

Keywords

Reprint years

2004

DOI

10.1023/a:1010509126669

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

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

Witold A. Pogorzelski, Piotr Wojtylak/Cn-Defini-tions of Propositional Connectives 1 Su Gao, Peter Gerdes/Computably Enumerable Equiva-lence Relations 27 Yoshihito Tanaka/Model Existence in Non-compact Modal. [REVIEW]Mary-Anne Williams, Thomas Meyer, Basic Infobase Change, David Billington & Andrew Rock - 2001 - Studia Logica 67:439-440.
Simple characterization of functionally complete one‐element sets of propositional connectives.Petar Maksimović & Predrag Janičić - 2006 - Mathematical Logic Quarterly 52 (5):498-504.
Gentzen-style axiomatizations for some conservative extensions of basic propositional logic.Mojtaba Aghaei & Mohammad Ardeshir - 2001 - Studia Logica 68 (2):263-285.
On Modal Logics of Partial Recursive Functions.Pavel Naumov - 2005 - Studia Logica 81 (3):295-309.
$$\varvec{Brings~It~About~That}$$ Operators Decomposed with Relating Semantics.Tomasz Jarmużek, Mateusz Klonowski & Piotr Kulicki - 2024 - Studia Logica 112 (3):541-559.
Some closure properties of finite definitions.Maricarmen Martinez - 2001 - Studia Logica 68 (1):43-68.
Modal companions of intermediate propositional logics.Alexander Chagrov & Michael Zakharyashchev - 1992 - Studia Logica 51 (1):49 - 82.
G3-style Sequent Calculi for Gurevich Logic and Its Neighbors.Norihiro Kamide & Sara Negri - forthcoming - Studia Logica:1-29.
Hans Kleine Buning and Theodor Lettmann, propositional logic: Deduction and algorithms.Anthony Hunter - 2002 - Studia Logica 71 (2):247-258.
Correction to: A Modal View on Resource-Bounded Propositional Logics.Pere Pardo - 2022 - Studia Logica 110 (6):1537-1538.

Analytics

Added to PP
2009-01-28

Downloads
84 (#248,657)

6 months
4 (#1,246,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Remarks on Sentential Logics.R. Suszko - 1975 - Journal of Symbolic Logic 40 (4):603-604.
Structural Completeness of the Propositional Calculus.W. A. Pogorzelski - 1975 - Journal of Symbolic Logic 40 (4):604-605.

Add more references