A synthetic axiomatization of map theory
From MaRDI portal
Publication:906269
DOI10.1016/J.TCS.2015.11.028zbMath1403.03019OpenAlexW2248151630MaRDI QIDQ906269
Publication date: 21 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.028
lambda calculusfoundation of mathematics\(\kappa\)-Scott semanticsHilbert's epsilon operatormap theory
Semantics in the theory of computing (68Q55) Consistency and independence results (03E35) Nonclassical and second-order set theories (03E70) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Map theory and antifoundation
- \(\kappa\)-continuous lattices and comprehension principles for Frege structures
- A type-free system extending (ZFC)
- Map theory
- LCF considered as a programming language
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- A set of postulates for the foundation of logic. II
- A \(\kappa\)-denotational semantics for map theory in ZFC+SI
This page was built for publication: A synthetic axiomatization of map theory