Ranked structures and arithmetic transfinite recursion

DOI10.1090/S0002-9947-07-04285-7zbMath1135.03026MaRDI QIDQ5437595

Noam Greenberg, Antonio Montalbán

Publication date: 21 January 2008

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Boolean algebrastopologytreesreverse mathematics\(p\)-groupsordinalshyperarithmetic

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (13)

Open Questions in Reverse Mathematics ⋮ What is effective transfinite recursion in reverse mathematics? ⋮ Weak and strong versions of effective transfinite recursion ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Computable bi-embeddable categoricity ⋮ Embeddings between well-orderings: computability-theoretic reductions ⋮ Degrees of bi-embeddable categoricity of equivalence structures ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Degree-invariant, analytic equivalence relations without perfectly many classes ⋮ Effectiveness for the dual Ramsey theorem ⋮ Degrees of bi-embeddable categoricity ⋮ ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The isomorphism problem for classes of computable fields
• Weak comparability of well orderings and reverse mathematics
• Countable algebra and set existence axioms
• Minimally generated Boolean algebras
• Reverse mathematics and homeomorphic embeddings
• Reverse mathematics and ordinal exponentiation
• Logical methods. In honor of Anil Nerode's 60th birthday
• Computable structures and the hyperarithmetical hierarchy
• Reverse mathematics and rank functions for directed graphs
• The homeomorphism problem for countable topological spaces
• Back and forth relations for reduced abelian \(p\)-groups
• Fine hierarchy and definable index sets
• Recent developments in the theory of Borel reducibility
• Recursive well-orderings
• The completeness of the isomorphism relation for countable Boolean algebras
• Analytic equivalence relations and Ulm-type classifications
• Reverse mathematics and the equivalence of definitions for well and better quasi-orders
• Comparing Classes of Finite Structures
• Infinitary properties of abelian torsion groups
• Invariants, Boolean algebras and ACA₀⁺
• Up to equimorphism, hyperarithmetic is recursive

This page was built for publication: Ranked structures and arithmetic transfinite recursion