Enumerations in computable structure theory
From MaRDI portal
Publication:2570135
DOI10.1016/j.apal.2005.02.001zbMath1081.03033OpenAlexW1985060429MaRDI QIDQ2570135
Russell G. Miller, Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, D. Reed Solomon, Charles F. D. McCoy
Publication date: 26 October 2005
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2005.02.001
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (47)
Jump inversions of algebraic structures and the \({\Sigma}\)-definability ⋮ Isomorphisms and algorithmic properties of structures with two equivalences ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ Degrees of categoricity of computable structures ⋮ Another Jump Inversion Theorem for Structures ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Punctual structures and primitive recursive reducibility ⋮ Rice sequences of relations ⋮ Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Preserving categoricity and complexity of relations ⋮ Two theorems on minimal generalized computable numberings ⋮ Jump inversions of algebraic structures and Σ‐definability ⋮ On the main scientific achievements of Victor Selivanov ⋮ A local version of the Slaman-Wehner theorem and families closed under finite differences ⋮ A hierarchy of classes of families and \(n\)-low degrees ⋮ A family with a single minimal but not least numbering ⋮ Reducibility on families ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ 2007 Annual Meeting of the Association for Symbolic Logic ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ The complexity of computable categoricity ⋮ The Slaman-Wehner theorem in higher recursion theory ⋮ Computability-theoretic categoricity and Scott families ⋮ Notes on the Jump of a Structure ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ Effective categoricity of equivalence structures ⋮ Degrees of autostability relative to strong constructivizations ⋮ Categoricity spectra of computable structures ⋮ Degrees of enumerations of countable Wehner-like families ⋮ Degree spectra of structures ⋮ Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension ⋮ Categoricity and complexity of relations over algebraic structures ⋮ Relations between algorithmic reducibilities of algebraic systems ⋮ Computability of Fraïssé limits ⋮ Computable embeddings for pairs of linear orders ⋮ Effective categoricity of abelian \(p\)-groups ⋮ COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ ⋮ The enumeration spectrum hierarchy ofn-families ⋮ Intrinsic bounds on complexity and definability at limit levels ⋮ Degree spectra and immunity properties ⋮ Spectra of theories and structures ⋮ Limitwise monotonic sequences and degree spectra of structures ⋮ COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA ⋮ RELATIVE TO ANY NON-HYPERARITHMETIC SET
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairs of recursive structures
- Computable single-valued numerations
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Generic copies of countable structures
- Enumerations of families of general recursive functions
- The quantity of nonautoequivalent constructivizations
- Finite computable dimension does not relativize
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- The computable enumerations of families of general recursive functions
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- A construction for recursive linear orderings
- Computably categorical structures and expansions by constants
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Intrinsically Hyperarithmetical Sets
- Effective model theory vs. recursive model theory
This page was built for publication: Enumerations in computable structure theory
