Ranked structures and arithmetic transfinite recursion
DOI10.1090/S0002-9947-07-04285-7zbMATH Open1135.03026MaRDI QIDQ5437595FDOQ5437595
Authors: Noam Greenberg, Antonio Montalbán 
Publication date: 21 January 2008
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Recommendations
- Arithmetic transfinite induction and recursive well-orderings
- Arithmetical transfinite induction and hierarchies of functions
- Recursive Structures and Ershov's Hierarchy
- Computable structures and the hyperarithmetical hierarchy
- Enumerations, countable structures and Turing degrees
- On recursively enumerable structures
- Hyperarithmetical Index Sets in Recursion Theory
- Arithmetical definability over finite structures
- scientific article; zbMATH DE number 5267925
Foundations of classical theories (including reverse mathematics) (03B30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimally generated Boolean algebras
- Logical methods. In honor of Anil Nerode's 60th birthday
- Computable structures and the hyperarithmetical hierarchy
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- Comparing Classes of Finite Structures
- Back and forth relations for reduced abelian \(p\)-groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinitary properties of abelian torsion groups
- Title not available (Why is that?)
- Weak comparability of well orderings and reverse mathematics
- Countable algebra and set existence axioms
- Recent developments in the theory of Borel reducibility
- Reverse mathematics and ordinal exponentiation
- Reverse mathematics and rank functions for directed graphs
- The completeness of the isomorphism relation for countable Boolean algebras
- Recursive well-orderings
- The isomorphism problem for classes of computable fields
- Analytic equivalence relations and Ulm-type classifications
- Fine hierarchy and definable index sets
- Invariants, Boolean algebras and ACA₀⁺
- Reverse mathematics and homeomorphic embeddings
- Up to equimorphism, hyperarithmetic is recursive
- The homeomorphism problem for countable topological spaces
- Title not available (Why is that?)
Cited In (17)
- Embeddings between well-orderings: computability-theoretic reductions
- Analytic equivalence relations satisfying hyperarithmetic-is-recursive
- Open questions in reverse mathematics
- Effectiveness for the dual Ramsey theorem
- Computable bi-embeddable categoricity
- Computability of Polish spaces up to homeomorphism
- What is effective transfinite recursion in reverse mathematics?
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- Fixed point theories and dependent choice
- Degrees of bi-embeddable categoricity of equivalence structures
- On bi-embeddable categoricity of algebraic structures
- \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
- Weak and strong versions of effective transfinite recursion
- Degree-invariant, analytic equivalence relations without perfectly many classes
- Stability of recursive structures in arithmetical degrees
- Degrees of bi-embeddable categoricity
- Title not available (Why is that?)
This page was built for publication: Ranked structures and arithmetic transfinite recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437595)
