Encoding many-valued logic in \lambda-calculus

DOI10.46298/LMCS-17(2:25)2021MaRDI QIDQ5009711zbMATH OpenOpenAlexFDO

Authors Fer-Jan De Vries

Publication date 5 August 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

generalised Böhm treelambda calculusmany-valued logicmeaningless termRussell's paradox

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4099256
• Propositional calculus for the sequential three-valued logic (McCarthy-like systems)
• scientific article; zbMATH DE number 1523047
• scientific article; zbMATH DE number 4049622
• scientific article; zbMATH DE number 2101974

Cites work

• A calculus for four-valued sequential logic
• A characterization of terms of the λI-calculus having a normal form
• A note on the Entscheidungsproblem
• A propositional logic with 4 values: true, false, divergent and meaningless
• A set of postulates for the foundation of logic
• An Unsolvable Problem of Elementary Number Theory
• Automatic synthesis of typed -programs on term algebras
• Bochvar-McCarthy logic and process algebra
• Combinatory logic. With two sections by William Craig.
• Decomposing the lattice of meaningless sets in the infinitary lambda calculus
• General recursive functions of natural numbers
• scientific article; zbMATH DE number 3695144 (Why is no real title available?)
• scientific article; zbMATH DE number 3485195 (Why is no real title available?)
• scientific article; zbMATH DE number 3520383 (Why is no real title available?)
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• scientific article; zbMATH DE number 1507231 (Why is no real title available?)
• scientific article; zbMATH DE number 937379 (Why is no real title available?)
• Infinitary lambda calculus
• On the concept of a random sequence
• Process algebra with four-valued logic
• Proposition algebra
• Recursive functions of symbolic expressions and their computation by machine, Part I
• The algebra of conditional logic
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The Mechanical Evaluation of Expressions
• Toward useful type-free theories. I
• Weakening the axiom of overlap in infinitary lambda calculus

Cited in

(1)

• Formalisations of Many‐Valued Propositional Calculi with Variable Functors

This page was built for publication: Encoding many-valued logic in $\lambda$-calculus

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