Degrees coded in jumps of orderings
From MaRDI portal
Recommendations
Cites work
Cited in
(72)- Generic copies of countable structures
- Uncountable degree spectra
- Computable isomorphisms, degree spectra of relations, and Scott families
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra of real closed fields
- Computability of distributive lattices
- Coding and definability in computable structures
- Effective algebraicity
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
- Degree spectra of structures relative to equivalences
- Degree spectra of structures
- Decomposability and computability
- Computable procedures for fields
- Turing degrees and automorphism groups of substructure lattices
- HKSS-completeness of modal algebras
- Using computability to measure complexity of algebraic structures and classes of structures
- Weak truth table degrees of structures
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
- Freely generated projective planes with finite computable dimension
- Generalization of Shapiro's theorem to higher arities and noninjective notations
- The _2⁰-spectrum of a linear order
- Minimality and completions of PA
- Rice sequences of relations
- Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
- Enumeration reducibility and computable structure theory
- Strength and weakness in computable structure theory
- The Lattice of Computably Enumerable Vector Spaces
- Some Questions in Computable Mathematics
- The Slaman-Wehner theorem in higher recursion theory
- Computability of Fraïssé limits
- On the complexity of the successivity relation in computable linear orderings
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
- Jumps of Orderings
- Spectra of Algebraic Fields and Subfields
- The degree spectra of homogeneous models
- Orderings with αth Jump Degree 0 (α)
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Boolean algebras, Stone spaces, and the iterated Turing jump
- A computable functor from graphs to fields
- Degree spectra of relations on a cone
- Sequences of n-diagrams
- Jump degrees of torsion-free abelian groups
- A characterization of the \(0\)-basis homogeneous bounding degrees
- Measuring complexities of classes of structures
- Least enumerations of unary partial structures
- On the notion of jump structure
- DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS
- The tree of tuples of a structure
- Bi‐embeddability spectra and bases of spectra
- Categoricity spectra for polymodal algebras
- CODING IN GRAPHS AND LINEAR ORDERINGS
- Turing degrees of nonabelian groups
- Degree spectra of prime models
- Jump operator and Yates Degrees
- Spectra of theories and structures
- Prime models of computably enumerable degree
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Degrees of categoricity on a cone via -systems
- Boolean algebras with distinguished endomorphisms and generating trees
- Effective model theory vs. recursive model theory
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- On the effective universality of mereological theories
- Computable Heyting algebras with distinguished atoms and coatoms
- Complexity profiles and generic Muchnik reducibility
- Ivan Soskov: a life in computability
- Borel graphable equivalence relations
- Relations enumerable from positive information
- A Lopez-Escobar theorem for continuous domains
- Generically computable linear orderings
- On computability-theoretic universality of Boolean-valued models
- Degrees of orderings not isomorphic to recursive linear orderings
- The jump operation for structure degrees
This page was built for publication: Degrees coded in jumps of orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770517)
