Degrees of Structures
From MaRDI portal
Cites work
Cited in
(59)- Algorithmic complexity of algebraic systems
- Degree spectra of real closed fields
- Computability of distributive lattices
- Coding and definability in computable structures
- Degree spectra of structures relative to equivalences
- Degrees of enumerations of countable Wehner-like families
- Degree spectra of structures
- Decomposability and computability
- Punctual structures and primitive recursive reducibility
- Graphs are not universal for online computability
- Spectral universality of linear orders with one binary relation
- Turing degrees and automorphism groups of substructure lattices
- Using computability to measure complexity of algebraic structures and classes of structures
- Weak truth table degrees of structures
- Freely generated projective planes with finite computable dimension
- Degrees of categoricity of computable structures
- Computable abelian groups
- 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
- The Slaman-Wehner theorem in higher recursion theory
- Conservative extensions of abstract structures
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
- Invariance in ℰ* and ℰ_{Π}
- Jumps of Orderings
- Spectra of Algebraic Fields and Subfields
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Cototal enumeration degrees and their applications to effective mathematics
- A computable functor from graphs to fields
- Measuring complexities of classes of structures
- Least enumerations of unary partial structures
- On the notion of jump structure
- A structural dichotomy in the enumeration degrees
- Bi‐embeddability spectra and bases of spectra
- CODING IN GRAPHS AND LINEAR ORDERINGS
- Turing degrees of nonabelian groups
- Another jump inversion theorem for structures
- Spectra of theories and structures
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Defining totality in the enumeration degrees
- Point Degree Spectra of Represented Spaces
- 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
- Families of permutations and ideals of Turing degrees
- Ivan Soskov: a life in computability
- Degrees of isomorphism types and countably categorical groups
- Scott sentence complexities of linear orderings
- A Lopez-Escobar theorem for continuous domains
- Generically computable linear orderings
- Degrees of relations on canonically ordered natural numbers and integers
- Permutation groups and ideals of Turing degrees
- The complexity of the successor and the block relations on computable linear orders
- On computability-theoretic universality of Boolean-valued models
- Degrees of orderings not isomorphic to recursive linear orderings
- The jump operation for structure degrees
- New degree spectra of Polish spaces
- A note on degrees of presentation of games as relational structures
This page was built for publication: Degrees of Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4750634)
