Degrees coded in jumps of orderings
From MaRDI portal
Publication:3770517
DOI10.2307/2273915zbMath0633.03038OpenAlexW2146750910MaRDI QIDQ3770517
Publication date: 1986
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273915
Related Items (64)
Degree spectra and computable dimensions in algebraic structures ⋮ The jump operation for structure degrees ⋮ Index set of structures with two equivalence relations that are autostable relative to strong constructivizations ⋮ DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS ⋮ Turing degrees of nonabelian groups ⋮ Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ Degree spectra of prime models ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ Freely generated projective planes with finite computable dimension ⋮ Generic copies of countable structures ⋮ Rice sequences of relations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Effective algebraicity ⋮ Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism ⋮ On the effective universality of mereological theories ⋮ Boolean algebras, Stone spaces, and the iterated Turing jump ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Bi‐embeddability spectra and bases of spectra ⋮ Complexity profiles and generic Muchnik reducibility ⋮ 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 ⋮ Generalization of Shapiro's theorem to higher arities and noninjective notations ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ Degree spectra of real closed fields ⋮ Uncountable degree spectra ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ Jump degrees of torsion-free abelian groups ⋮ The Slaman-Wehner theorem in higher recursion theory ⋮ HKSS-completeness of modal algebras ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Measuring complexities of classes of structures ⋮ Computability of distributive lattices ⋮ Degree Spectra of Relations on a Cone ⋮ Categoricity spectra for polymodal algebras ⋮ The -spectrum of a linear order ⋮ Spectra of Algebraic Fields and Subfields ⋮ Minimality and completions of PA ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Degree spectra of structures relative to equivalences ⋮ A characterization of the 0-basis homogeneous bounding degrees ⋮ Effective model theory vs. recursive model theory ⋮ Coding and definability in computable structures ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Jumps of Orderings ⋮ Degree spectra of structures ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ The degree spectra of homogeneous models ⋮ Computability of Fraïssé limits ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ Spectra of theories and structures ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Prime models of computably enumerable degree ⋮ Decomposability and computability ⋮ Degrees of orderings not isomorphic to recursive linear orderings ⋮ Weak truth table degrees of structures ⋮ Computable procedures for fields ⋮ Sequences of n-diagrams
Cites Work
This page was built for publication: Degrees coded in jumps of orderings
