Forcing in stable models of untyped \(\lambda\)-calculus

DOI10.1016/S0019-3577(99)80005-6zbMath1025.03503MaRDI QIDQ698623

Rainer Kerth

Publication date: 22 September 2002

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

zbMATH Keywords

forcingstable modeluntyped \(\lambda\)-calculus

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Combinatory logic and lambda calculus (03B40) Model-theoretic forcing (03C25)

Related Items (4)

Graph easy sets of mute lambda terms ⋮ Easiness in graph models ⋮ On the construction of stable models of untyped \(\lambda\)-calculus ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Retractions of dI-domains as a model for Type:Type
• The system \({\mathcal F}\) of variable types, fifteen years later
• On the construction of stable models of untyped \(\lambda\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forcing in stable models of untyped \(\lambda\)-calculus