Forcing in stable models of untyped -calculus

DOI10.1016/S0019-3577(99)80005-6zbMATH Open1025.03503MaRDI QIDQ698623FDOQ698623

Authors: Rainer Kerth 

Publication date: 22 September 2002

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

Recommendations

• On the construction of stable models of untyped \(\lambda\)-calculus
• scientific article; zbMATH DE number 3889500
• Easiness in graph models
• Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
• scientific article; zbMATH DE number 906954

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)

Cites Work

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

Cited In (7)

• On the construction of stable models of untyped \(\lambda\)-calculus
• Graph easy sets of mute lambda terms
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
• Easiness in graph models
• Template iterations with non-definable ccc forcing notions
• Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally

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

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