Topological incompleteness and order incompleteness of the lambda calculus
From MaRDI portal
Publication:5267435
Recommendations
- Towards lambda calculus order-incompleteness
- scientific article; zbMATH DE number 4087629
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Ordered models of the lambda calculus
Cited in
(13)- Order-incompleteness and finite lambda reduction models
- Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
- Easy lambda-terms are not always simple
- Effective λ-models versus recursively enumerable λ-theories
- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Towards lambda calculus order-incompleteness
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Ordered models of the lambda calculus
- scientific article; zbMATH DE number 4087629 (Why is no real title available?)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Graph lambda theories
- Easiness in graph models
- \(a\)-logic with arrows
This page was built for publication: Topological incompleteness and order incompleteness of the lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267435)
