Strong stability and the incompleteness of stable models for -calculus

DOI10.1016/S0168-0072(99)00015-9zbMATH Open0935.03021MaRDI QIDQ1125063FDOQ1125063

Authors: Olivier Bastonero, Xavier Gouy 

Publication date: 29 November 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 906954
• On the construction of stable models of untyped \(\lambda\)-calculus
• Forcing in stable models of untyped \(\lambda\)-calculus
• Topological incompleteness and order incompleteness of the lambda calculus
• scientific article; zbMATH DE number 4087629

zbMATH Keywords

strong stabilitydenotational semanticslambda calculusincompletenesscontinuous modelstable models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (8)

• Completeness of continuation models for \(\lambda_\mu\)-calculus
• On the construction of stable models of untyped \(\lambda\)-calculus
• Forcing in stable models of untyped \(\lambda\)-calculus
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• On the completeness of order-theoretic models of the \(\lambda \)-calculus
• Towards lambda calculus order-incompleteness
• Easiness in graph models
• Graph lambda theories

This page was built for publication: Strong stability and the incompleteness of stable models for \(\lambda\)-calculus

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