The following pages link to Degrees of Structures (Q4750634):
Displaying 50 items.
- Measuring complexities of classes of structures (Q499081) (← links)
- Degrees of isomorphism types and countably categorical groups (Q661283) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- The jump operation for structure degrees (Q818923) (← links)
- New degree spectra of Polish spaces (Q820494) (← links)
- A note on degrees of presentation of games as relational structures (Q912772) (← links)
- Algorithmic complexity of algebraic systems (Q1121875) (← links)
- Degree spectra of real closed fields (Q1734266) (← links)
- Computability of distributive lattices (Q1745078) (← links)
- Coding and definability in computable structures (Q1782235) (← links)
- Degree spectra of structures relative to equivalences (Q2011365) (← links)
- Degrees of enumerations of countable Wehner-like families (Q2036467) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Decomposability and computability (Q2093255) (← links)
- Punctual structures and primitive recursive reducibility (Q2172879) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Spectral universality of linear orders with one binary relation (Q2191376) (← links)
- Turing degrees and automorphism groups of substructure lattices (Q2213916) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Weak truth table degrees of structures (Q2354621) (← links)
- Freely generated projective planes with finite computable dimension (Q2401538) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- COMPUTABLE ABELIAN GROUPS (Q2795203) (← links)
- Effectively Existentially-Atomic Structures (Q2970960) (← links)
- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey (Q2970964) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- The Slaman-Wehner theorem in higher recursion theory (Q3003597) (← links)
- Conservative Extensions of Abstract Structures (Q3091469) (← links)
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra (Q3188263) (← links)
- Invariance in ℰ* and ℰ_{Π} (Q3378462) (← links)
- Jumps of Orderings (Q3484823) (← links)
- Spectra of Algebraic Fields and Subfields (Q3576055) (← links)
- Every Low Boolean Algebra is Isomorphic to a Recursive One (Q4318310) (← links)
- Cototal enumeration degrees and their applications to effective mathematics (Q4563667) (← links)
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
- (Q4993800) (← links)
- (Q4993818) (← links)
- A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES (Q5082054) (← links)
- Bi‐embeddability spectra and bases of spectra (Q5108859) (← links)
- CODING IN GRAPHS AND LINEAR ORDERINGS (Q5148104) (← links)
- Turing degrees of nonabelian groups (Q5295123) (← links)
- Another Jump Inversion Theorem for Structures (Q5326388) (← links)
- Spectra of theories and structures (Q5496464) (← links)
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS (Q5738187) (← links)
- Defining totality in the enumeration degrees (Q5741445) (← links)
- Point Degree Spectra of Represented Spaces (Q5864311) (← links)
- The theory of projective planes is complete with respect to degree spectra and effective dimensions (Q5965134) (← links)
- On the effective universality of mereological theories (Q6094132) (← links)
- Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
