Graduate studies at Western
Studia Logica 95 (3):355-378 (2010)
|Abstract||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||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Steven T. Kuhn (1980). Quantifiers as Modal Operators. Studia Logica 39 (2-3):145 - 158.
Sergei P. Odintsov (2006). Absurdity as Unary Operator. Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):225-242.
Chrysafis Hartonas (1997). Duality for Lattice-Ordered Algebras and for Normal Algebraizable Logics. Studia Logica 58 (3):403-450.
Robert A. Herrmann (2007). General Logic-Systems and Finite Consequence Operators. Logica Universalis 1 (1):201-208.
Arnold Koslow (2007). Structuralist Logic: Implications, Inferences, and Consequences. [REVIEW] Logica Universalis 1 (1):167-181.
George Goguadze, Carla Piazza & Yde Venema (2003). Simulating Polyadic Modal Logics by Monadic Ones. Journal of Symbolic Logic 68 (2):419-462.
René David & Karim Nour (1995). Storage Operators and Directed Lambda-Calculus. Journal of Symbolic Logic 60 (4):1054-1086.
A. Baltag & S. Smets (2008). A Dynamic-Logical Perspective on Quantum Behavior. Studia Logica 89 (2):187 - 211.
Jean-Baptiste Joinet, Harold Schellinx & Lorenzo Tortora de Falco (2002). SN and CR for Free-Style LKtq: Linear Decorations and Simulation of Normalization. Journal of Symbolic Logic 67 (1):162-196.
Added to index2010-07-26
Total downloads19 ( #71,344 of 738,617 )
Recent downloads (6 months)1 ( #61,778 of 738,617 )
How can I increase my downloads?