Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
From MaRDI portal
Publication:3767329
DOI10.2307/2000633zbMath0631.03017OpenAlexW4254049583MaRDI QIDQ3767329
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2000633
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (62)
Degree spectra and computable dimensions in algebraic structures ⋮ The jump operation for structure degrees ⋮ Inseparability in recursive copies ⋮ On categoricity spectra for locally finite graphs ⋮ Strong \(\Delta ^ 0_ 2\) categoricity ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ Effective choice of constructivizations and recursive consistency of problems on constructive models ⋮ Three topological reducibilities for discontinuous functions ⋮ Ramified systems ⋮ Abelian \(p\)-groups and the halting problem ⋮ Stability of recursive structures in arithmetical degrees ⋮ Effectively categorical abelian groups ⋮ Scott ranks of models of a theory ⋮ Intrinsically \(\Sigma ^ 0_{\alpha}\) relations ⋮ Computable completely decomposable groups ⋮ Possible degrees in recursive copies. II ⋮ On a question of Kalimullin ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Generic copies of countable structures ⋮ Turing reducibility in the fine hierarchy ⋮ The diversity of categoricity without delay ⋮ Strong degrees of categoricity and weak density ⋮ Pairs of recursive structures ⋮ Labelling systems and r.e. structures ⋮ Constructions by transfinitely many workers ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ Uncountable degree spectra ⋮ Sufficiency conditions for theories with recursive models ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Computability-theoretic categoricity and Scott families ⋮ Measuring complexities of classes of structures ⋮ Computability of distributive lattices ⋮ The property “arithmetic-is-recursive” on a cone ⋮ Incomparable prime ideals of recursively enumerable degrees ⋮ Stability among r.e. quotient algebras ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ Turing computable embeddings, computable infinitary equivalence, and linear orders ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES ⋮ Punctual categoricity relative to a computable oracle ⋮ Jumps of Orderings ⋮ Categoricity spectra of computable structures ⋮ Degree spectra of structures ⋮ Punctual categoricity spectra of computably categorical structures ⋮ Categorical linearly ordered structures ⋮ Categoricity in hyperarithmetical degrees ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Degrees of bi-embeddable categoricity ⋮ On the $n$-back-and-forth types of Boolean algebras ⋮ Turing degrees of certain isomorphic images of computable relations ⋮ Coding a family of sets ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations ⋮ 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
Cites Work
This page was built for publication: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
