Ranked structures and arithmetic transfinite recursion
From MaRDI portal
Publication:5437595
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
Cites work
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 1461253 (Why is no real title available?)
- scientific article; zbMATH DE number 3308418 (Why is no real title available?)
- scientific article; zbMATH DE number 2236634 (Why is no real title available?)
- scientific article; zbMATH DE number 2236636 (Why is no real title available?)
- Analytic equivalence relations and Ulm-type classifications
- Back and forth relations for reduced abelian \(p\)-groups
- Comparing Classes of Finite Structures
- Computable structures and the hyperarithmetical hierarchy
- Countable algebra and set existence axioms
- Fine hierarchy and definable index sets
- Infinitary properties of abelian torsion groups
- Invariants, Boolean algebras and ACA₀⁺
- Logical methods. In honor of Anil Nerode's 60th birthday
- Minimally generated Boolean algebras
- Recent developments in the theory of Borel reducibility
- Recursive well-orderings
- Reverse mathematics and homeomorphic embeddings
- Reverse mathematics and ordinal exponentiation
- Reverse mathematics and rank functions for directed graphs
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- The completeness of the isomorphism relation for countable Boolean algebras
- The homeomorphism problem for countable topological spaces
- The isomorphism problem for classes of computable fields
- Up to equimorphism, hyperarithmetic is recursive
- Weak comparability of well orderings and reverse mathematics
Cited in
(17)- Computable bi-embeddable categoricity
- Fixed point theories and dependent choice
- scientific article; zbMATH DE number 2236636 (Why is no real title available?)
- Analytic equivalence relations satisfying hyperarithmetic-is-recursive
- Stability of recursive structures in arithmetical degrees
- Embeddings between well-orderings: computability-theoretic reductions
- Degrees of bi-embeddable categoricity of equivalence structures
- Degree-invariant, analytic equivalence relations without perfectly many classes
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- Weak and strong versions of effective transfinite recursion
- What is effective transfinite recursion in reverse mathematics?
- Computability of Polish spaces up to homeomorphism
- Open questions in reverse mathematics
- Effectiveness for the dual Ramsey theorem
- Degrees of bi-embeddable categoricity
- On bi-embeddable categoricity of algebraic structures
- \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
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)
