Degrees of Structures
From MaRDI portal
Publication:4750634
DOI10.2307/2273222zbMath0512.03024OpenAlexW2142840306MaRDI QIDQ4750634
Publication date: 1981
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273222
Related Items
The jump operation for structure degrees ⋮ New degree spectra of Polish spaces ⋮ Turing degrees of nonabelian groups ⋮ Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ Cototal enumeration degrees and their applications to effective mathematics ⋮ Degrees of categoricity of computable structures ⋮ Freely generated projective planes with finite computable dimension ⋮ A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES ⋮ Another Jump Inversion Theorem for Structures ⋮ Punctual structures and primitive recursive reducibility ⋮ Algorithmic complexity of algebraic systems ⋮ Graphs are not universal for online computability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Spectral universality of linear orders with one binary relation ⋮ On the effective universality of mereological theories ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Bi‐embeddability spectra and bases of spectra ⋮ Families of permutations and ideals of Turing degrees ⋮ Effectively Existentially-Atomic Structures ⋮ Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Some Questions in Computable Mathematics ⋮ A note on degrees of presentation of games as relational structures ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ Degrees of isomorphism types and countably categorical groups ⋮ Degree spectra of real closed fields ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ The Slaman-Wehner theorem in higher recursion theory ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Measuring complexities of classes of structures ⋮ Computability of distributive lattices ⋮ Spectra of Algebraic Fields and Subfields ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ Defining totality in the enumeration degrees ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Degree spectra of structures relative to equivalences ⋮ Coding and definability in computable structures ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Jumps of Orderings ⋮ Degrees of enumerations of countable Wehner-like families ⋮ Degree spectra of structures ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Invariance in ℰ* and ℰ_{Π} ⋮ Conservative Extensions of Abstract Structures ⋮ Spectra of theories and structures ⋮ Decomposability and computability ⋮ Point Degree Spectra of Represented Spaces ⋮ Degrees of orderings not isomorphic to recursive linear orderings ⋮ Weak truth table degrees of structures
Cites Work
