The λ-calculus is ω-incomplete

DOI10.2307/2272645zbMath0299.02029OpenAlexW1540909559MaRDI QIDQ4053617

Gordon D. Plotkin

Publication date: 1974

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272645

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categoricity and completeness of theories (03C35)

Related Items (13)

Partial evaluation and \(\omega\)-completeness of algebraic specifications ⋮ Implication and analysis in classical Frege structures ⋮ Partial combinatory algebra and generalized numberings ⋮ An initial algebra approach to term rewriting systems with variable binders ⋮ Two-level semantics and abstract interpretation ⋮ Reasoning about multi-stage programs ⋮ On finite alphabets and infinite bases ⋮ Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constructive proofs of the range property in lambda calculus ⋮ Kleene's Logic with equality ⋮ Which data types have \(\omega\)-complete initial algebra specifications?

Cites Work

• Combinatory logic. Vol. II

This page was built for publication: The λ-calculus is ω-incomplete