Forcing in stable models of untyped -calculus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3648679 (Why is no real title available?)
- scientific article; zbMATH DE number 3556025 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 482822 (Why is no real title available?)
- On the construction of stable models of untyped \(\lambda\)-calculus
- Retractions of dI-domains as a model for Type:Type
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
Cited in
(7)- Template iterations with non-definable ccc forcing notions
- Graph easy sets of mute lambda terms
- Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
- On the construction of stable models of untyped \(\lambda\)-calculus
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Easiness in graph models
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)
