On the definitional embeddability of the combinatory logic theory into the first-order predicate calculus

zbMATH Open1370.03023MaRDI QIDQ2811650FDOQ2811650

Authors: Vladimir I. Shalack 

Publication date: 10 June 2016

Published in: Logicheskie Issledovaniya (Search for Journal in Brave)

Recommendations

• On the definitional embeddability of some elementary algebraic theories into the first-order predicate calculus
• Systems of illative combinatory logic complete for first-order propositional and predicate calculus
• Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus
• The Logic of Calculation
• On some applied first-order theories which can be represented by definitions

zbMATH Keywords

combinatory logicpredicate logiccomputable functionsdefinitionsdefinitional embedding

Mathematics Subject Classification ID

Classical first-order logic (03B10) Combinatory logic and lambda calculus (03B40)

Cited In (2)

• A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
• On the definitional embeddability of some elementary algebraic theories into the first-order predicate calculus

This page was built for publication: On the definitional embeddability of the combinatory logic theory into the first-order predicate calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811650)