Schwichtenberg-style lambda definability is undecidable
From MaRDI portal
Recommendations
Cited in
(8)- On -definability of arithmetical functions with indeterminate values of arguments
- scientific article; zbMATH DE number 17832 (Why is no real title available?)
- scientific article; zbMATH DE number 512784 (Why is no real title available?)
- scientific article; zbMATH DE number 1984520 (Why is no real title available?)
- Encoding of the halting problem into the monster type and applications
- scientific article; zbMATH DE number 6792351 (Why is no real title available?)
- Lambda-definable term rewriting systems
- \(\lambda\)-definability of free algebras
This page was built for publication: Schwichtenberg-style lambda definability is undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024913)