Schönfinkel-type operators for classical logic

DOI10.1007/S11225-010-9265-3zbMath1204.03018OpenAlexW2038039539MaRDI QIDQ993497

Katalin Bimbó

Publication date: 20 September 2010

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-010-9265-3

zbMATH Keywords

functional completenessquantifiersPeircePostSchönfinkel.Sheffersufficient sets of operators

Mathematics Subject Classification ID

Classical first-order logic (03B10) Classical propositional logic (03B05) History of mathematical logic and foundations (03-03)

Related Items (1)

Simplex sigillum veri: Peano, Frege, and Peirce on the Primitives of Logic

Cites Work

• Combinatory logic. With two sections by William Craig.
• Post's functional completeness theorem
• Combinatory logic. Vol. II
• Function Algebras on Finite Sets
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Schönfinkel-type operators for classical logic