Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
From MaRDI portal
Recommendations
Cites work
Cited in
(68)- Strong \(\Delta ^ 0_ 2\) categoricity
- Recursive categoricity and recursive stability
- Stability of recursive structures in arithmetical degrees
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Generic copies of countable structures
- Uncountable degree spectra
- Sufficiency conditions for theories with recursive models
- Stability among r.e. quotient algebras
- Turing degrees of certain isomorphic images of computable relations
- Coding a family of sets
- Hyperarithmetical relations in expansions of recursive structures
- Effective choice for relations and reducibilities in classes of constructive and positive models
- Primitive Jordan algebras
- Finitely generated groups with the M. Hall property
- Locally finite simple groups as a product of two inert subgroups
- Local characterizations of infinite alternating and Lie type groups
- A semiorthogonal sum of monocomposition algebras with unity
- Superdecomposable pure injective modules over commutative valuation rings
- Inseparability in recursive copies
- Ramified systems
- Possible degrees in recursive copies. II
- Degree spectra and computable dimensions in algebraic structures
- Scott ranks of models of a theory
- The diversity of categoricity without delay
- Computability-theoretic categoricity and Scott families
- Computability of distributive lattices
- Categoricity in hyperarithmetical degrees
- Turing computable embeddings, computable infinitary equivalence, and linear orders
- Punctual categoricity relative to a computable oracle
- Categoricity spectra of computable structures
- Degree spectra of structures
- Punctual categoricity spectra of computably categorical structures
- On bi-embeddable categoricity of algebraic structures
- Turing reducibility in the fine hierarchy
- Strong degrees of categoricity and weak density
- Categorical linearly ordered structures
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Effective choice of constructivizations and recursive consistency of problems on constructive models
- Effectively categorical abelian groups
- Effective categoricity for distributive lattices and Heyting algebras
- A note on effective categoricity for linear orderings
- Abelian p-groups and the halting problem
- On the n-back-and-forth types of Boolean algebras
- Computable completely decomposable groups
- Jumps of Orderings
- On a question of Kalimullin
- Torsion-free abelian groups with optimal Scott families
- Degrees of categoricity and spectral dimension
- Measuring complexities of classes of structures
- Degrees of bi-embeddable categoricity
- Three topological reducibilities for discontinuous functions
- The property ``arithmetic-is-recursive on a cone
- Computability in uncountable binary trees
- Degrees of categoricity on a cone via -systems
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
- Computability of Polish spaces up to homeomorphism
- Iterated priority arguments in descriptive set theory
- Scott sentence complexities of linear orderings
- Incomparable prime ideals of recursively enumerable degrees
- Scott analysis, linear orders, and almost periodic functions
- On categoricity of scattered linear orders of constructive ranks
- The structural complexity of models of arithmetic
- The jump operation for structure degrees
- On categoricity spectra for locally finite graphs
- Pairs of recursive structures
- Labelling systems and r.e. structures
- Constructions by transfinitely many workers
This page was built for publication: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767329)
