Asymptotic Properties of Combinatory Logic

DOI10.1007/978-3-319-17142-5_7zbMath1461.03015OpenAlexW659080344MaRDI QIDQ2948454

Maciej Bendkowski, Marek Zaionc, Katarzyna Grygiel

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_7

zbMATH Keywords

combinatory logicmodels of computationasymptotic probability in logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (2)

Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Normal-order reduction grammars

Cites Work

• Enumeration of generalized BCI lambda-terms
• In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
• Combinatory logic. With two sections by William Craig.
• Statistics of intuitionistic versus classical logics
• Probability distribution for simple tautologies
• Classical and Intuitionistic Logic Are Asymptotically Identical
• Some typical properties of large AND/OR Boolean formulas
• Statistical properties of simple types
• And/Or Trees Revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic Properties of Combinatory Logic