The kernel strategy and its use for the study of combinatory logic

DOI10.1007/BF00881795zbMath0802.03010WikidataQ114267042 ScholiaQ114267042MaRDI QIDQ1311399

Larry Wos

Publication date: 7 December 1994

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

paradoxesnormal formsautomated reasoningcombinatory logicfragmentfixed-point properties

Mathematics Subject Classification ID

Related Items (5)

OTTER experiments in a system of combinatory logic ⋮ Automatic construction of finite algebras ⋮ The Legacy of a Great Researcher ⋮ Problems on the generation of finite models ⋮ Larry Wos: visions of automated reasoning

Uses Software

• OTTER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The absence and the presence of fixed point combinators
• Set theory in first-order logic: Clauses for Gödel's axioms
• A case study in automated theorem proving: Finding sages in combinatory logic
• Erratum to ``A case study in automated theorem proving: finding sages in combinatory logic
• The lambda calculus, its syntax and semantics
• Complexity and related enhancements for automated theorem-proving programs
• Combinatory logic. Vol. II
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• The Concept of Demodulation in Theorem Proving

This page was built for publication: The kernel strategy and its use for the study of combinatory logic