Studia Logica 67 (1):1-26 (2001)

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.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1010509126669
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,355
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

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

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
55 ( #208,325 of 2,519,513 )

Recent downloads (6 months)
1 ( #407,153 of 2,519,513 )

How can I increase my downloads?

Downloads

My notes