Encoding many-valued logic in $\lambda$-calculus

DOI10.46298/lmcs-17(2:25)2021OpenAlexW3186360345MaRDI QIDQ5009711

Fer-Jan de Vries

Publication date: 5 August 2021

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.07667

zbMATH Keywords

many-valued logiclambda calculusRussell's paradoxgeneralised Böhm treemeaningless term

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• A calculus for four-valued sequential logic
• Combinatory logic. With two sections by William Craig.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The algebra of conditional logic
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• Infinitary lambda calculus
• A set of postulates for the foundation of logic
• General recursive functions of natural numbers
• Proposition algebra
• Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Toward useful type-free theories. I
• A characterization of terms of the λI-calculus having a normal form
• Process algebra with four-valued logic
• A propositional logic with 4 values: true, false, divergent and meaningless
• The Mechanical Evaluation of Expressions
• An Unsolvable Problem of Elementary Number Theory
• A note on the Entscheidungsproblem
• On the concept of a random sequence
• Bochvar-McCarthy logic and process algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item