Studia Logica 95 (3):355-378 (2010)

Katalin Bimbo
University of Alberta
We briefly overview some of the historical landmarks on the path leading to the reduction of the number of logical connectives in classical logic. Relying on the duality inherent in Boolean algebras, we introduce a new operator ( Nallor ) that is the dual of Schönfinkel’s operator. We outline the proof that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic ( Fol ). Having scrutinized the proof, we pinpoint the theorems of Fol that are needed in the proof. Using the insights gained from the proof, we show that there are four binary operators that each can serve as the only undefined logical constant for Fol . Finally, we show that from every n -ary connective that yields a functionally complete singleton set of connectives two Schönfinkel-type operators are definable, and all the latter are so definable.
Keywords Philosophy   Computational Linguistics   Mathematical Logic and Foundations   Logic
Categories (categorize this paper)
DOI 10.1007/s11225-010-9265-3
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: 55,856
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

The Mathematics of Metamathematics.Helena Rasiowa - 1963 - Warszawa, Państwowe Wydawn. Naukowe.
Principia Mathematica.A. N. Whitehead - 1926 - Mind 35 (137):130.
Principia Mathematica.Morris R. Cohen - 1912 - Philosophical Review 21 (1):87.

View all 11 references / Add more references

Citations of this work BETA

Combinatory Logic.Katalin Bimbó - 2009 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles

Mixed Logic and Storage Operators.Karim Nour - 2000 - Archive for Mathematical Logic 39 (4):261-280.
The Operators of Vector Logic.Eduardo Mizraji - 1996 - Mathematical Logic Quarterly 42 (1):27-40.
Strong Storage Operators and Data Types.Karim Nour - 1995 - Archive for Mathematical Logic 34 (1):65-78.
A General Type for Storage Operators.Karim Nour - 1995 - Mathematical Logic Quarterly 41 (4):505-514.
Storage Operators and ∀‐Positive Types in TTR Type System.Karim Nour - 1996 - Mathematical Logic Quarterly 42 (1):349-368.
Storage Operators and Forall-Positive Types of System TTR.Karim Nour - 1996 - Mathematical Logic Quarterly 42:349-368.
Linearity and Negation.Kenji Tokuo - 2012 - Journal of Applied Non-Classical Logics 22 (1-2):43-51.
Positive Set-Operators of Low Complexity.Athanossios Tzouvaras - 2003 - Mathematical Logic Quarterly 49 (3):284.
Quantifiers as Modal Operators.Steven T. Kuhn - 1980 - Studia Logica 39 (2-3):145 - 158.


Added to PP index

Total views
79 ( #124,670 of 2,401,723 )

Recent downloads (6 months)
8 ( #88,905 of 2,401,723 )

How can I increase my downloads?


My notes