Map theory

DOI10.1016/0304-3975(92)90296-RzbMath0805.03044OpenAlexW2912844405MaRDI QIDQ1193653

Klaus Grue

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90296-r

zbMATH Keywords

consistencyZFCchoice functionsemanticslambda calculusaxiomatisationstrongly inaccessible cardinalMacCarthy's conditionalmodel of Map theorywell-foundedness predicate

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Consistency and independence results (03E35) Axiomatics of classical set theory and its fragments (03E30) Nonclassical and second-order set theories (03E70) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Unnamed Item ⋮ Unifying sets and programs via dependent types ⋮ A synthetic axiomatization of map theory ⋮ A \(\kappa\)-denotational semantics for map theory in ZFC+SI ⋮ Unifying Sets and Programs via Dependent Types ⋮ Dedekind completion as a method for constructing new Scott domains ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models

Cites Work

• Set theory. An introduction to independence proofs
• The lambda calculus, its syntax and semantics
• The Vienna development method: The meta-language
• Towards a computation system based on set theory
• A new implementation technique for applicative languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Map theory