Transfinite recursion and computation in the iterative conception of set

DOI10.1007/S11229-014-0560-9zbMath1369.03117OpenAlexW1998092208MaRDI QIDQ510712

Benjamin G. Rin

Publication date: 14 February 2017

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-014-0560-9

zbMATH Keywords

recursionset theoryreplacementinfinityKreiseliterative conceptionordinal Turing machinetransfinite computation

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Axiomatics of classical set theory and its fragments (03E30) Ordinal and cardinal numbers (03E10) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Ordinal machines and admissible recursion theory
• Set theory. An introduction to independence proofs
• Set theory. An introduction to large cardinals
• Levy and set theory
• Axiom schemata of strong infinity in axiomatic set theory
• Slim models of Zermelo set theory
• Turing Computations On Ordinals
• Bernays and Set Theory
• An Answer to Hellman's Question: ‘Does Category Theory Provide a Framework for Mathematical Structuralism?’†
• Mathematics and Bleak House
• Set Theory
• Strong Logics of First and Second Order
• Church Without Dogma: Axioms for Computability
• In Praise of Replacement
• Metarecursive sets
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On reflection principles
• 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
• Unnamed Item

This page was built for publication: Transfinite recursion and computation in the iterative conception of set