Degree spectra of structures
From MaRDI portal
Publication:2036471
DOI10.1007/s10958-021-05424-0OpenAlexW3166127673MaRDI QIDQ2036471
Publication date: 29 June 2021
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-021-05424-0
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computability on linear orderings enriched with predicates
- Generic Muchnik reducibility and presentations of fields
- Linear orderings of low degree
- Cuts of linear orders
- Enumerations and completely decomposable torsion-free abelian groups
- Computably categorical Boolean algebras enriched by ideals and atoms
- Degrees of orderings not isomorphic to recursive linear orderings
- Algorithmic complexity of algebraic systems
- Generic copies of countable structures
- Autostability of models
- Computable models of theories with few models
- Degree spectra and computable dimensions in algebraic structures
- New degree spectra of abelian groups
- Degree spectra of real closed fields
- Computability of distributive lattices
- Scattered linear orderings with no computable presentation
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Spectrum of the field of computable real numbers
- Effective categoricity for distributive lattices and Heyting algebras
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
- The theory of well-quasi-ordering: a frequently discovered concept
- Enumerations in computable structure theory
- Undecidable theories
- Computable Boolean algebras
- The -spectrum of a linear order
- Limitwise monotonic sequences and degree spectra of structures
- Natural Large Degree Spectra
- RELATIVE TO ANY NON-HYPERARITHMETIC SET
- Low linear orderings
- Spectra of highn and non-lown degrees
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
- Path integral quantisation of the open strings normal modes
- Degrees of Unsolvability: A Tutorial
- Degree spectra and immunity properties
- Spectra of degrees of some structures
- Equivalence Relations on Classes of Computable Structures
- Almost computably enumerable families of sets
- Increasing η -representable degrees
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Degrees coded in jumps of orderings
- Recursively Categorical Linear Orderings
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Degrees of Structures
- Every Low 2 Boolean Algebra has a Recursive Copy
- Jump degrees of torsion-free abelian groups
- Turing degrees of isomorphism types of algebraic objects
- Δ 2 0 -copies of linear orderings
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Hierarchies of Boolean algebras
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Effective categoricity of computable linear orderings
This page was built for publication: Degree spectra of structures
