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