Enumeration reducibility and computable structure theory
From MaRDI portal
Publication:2970965
Recommendations
Cites work
- scientific article; zbMATH DE number 6536312 (Why is no real title available?)
- scientific article; zbMATH DE number 52976 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 1302876 (Why is no real title available?)
- scientific article; zbMATH DE number 598184 (Why is no real title available?)
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- scientific article; zbMATH DE number 2039009 (Why is no real title available?)
- scientific article; zbMATH DE number 3995659 (Why is no real title available?)
- scientific article; zbMATH DE number 3248010 (Why is no real title available?)
- scientific article; zbMATH DE number 3348085 (Why is no real title available?)
- scientific article; zbMATH DE number 3349780 (Why is no real title available?)
- scientific article; zbMATH DE number 3358471 (Why is no real title available?)
- scientific article; zbMATH DE number 3372032 (Why is no real title available?)
- scientific article; zbMATH DE number 2237359 (Why is no real title available?)
- scientific article; zbMATH DE number 2237372 (Why is no real title available?)
- scientific article; zbMATH DE number 2237373 (Why is no real title available?)
- A Jump Inversion Theorem for the Degree Spectra
- A Jump Inversion Theorem for the Degree Spectra
- A Note on ω-Jump Inversion of Degree Spectra of Structures
- A computable ℵ0-categorical structure whose theory computes true arithmetic
- A jump inversion theorem for the enumeration jump
- A jump inversion theorem for the semilattices of \(\Sigma\)-degrees
- A note on the hyperarithmetical hierarchy
- Abstract Computability and Invariant Definability
- Abstract First Order Computability. I
- Another jump inversion theorem for structures
- Arithmetical Reducibilities I
- Ash's theorem for abstract structures
- Complexity of Categorical Theories with Computable Models
- Computability by means of effectively definable schemes and definability via enumerations
- Computable structures and the hyperarithmetical hierarchy
- Conservative extensions of abstract structures
- Constructing minimal pairs of degrees
- Definability in the local theory of the \(\omega \)-enumeration degrees
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- Definability via enumerations
- Defining totality in the enumeration degrees
- Degrees coded in jumps of orderings
- Degrees of Structures
- Effective model theory vs. recursive model theory
- Effective properties of Marker's extensions
- Elementary induction on abstract structures
- Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
- Enumeration Degrees and Enumerability of Familes
- Enumeration reducibility and partial degrees
- Enumerations in computable structure theory
- Enumerations, countable structures and Turing degrees
- Every Set has a Least Jump Enumeration
- Exact Pair Theorem for the ω-Enumeration Degrees
- Generalizations of enumeration reducibility using recursive infinitary propositional sentences
- Generic copies of countable structures
- HF-computability
- Interpreting true arithmetic in the local structure of the enumeration degrees
- Jumps of quasi-minimal enumeration degrees
- Logical Approaches to Computational Barriers
- Metarecursive sets
- New Computational Paradigms
- Non Σn axiomatizable almost strongly minimal theories
- Note on Degrees of Partial Functions
- Notes on the Jump of a Structure
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
- On the $n$-back-and-forth types of Boolean algebras
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Quasi-minimal degrees for degree spectra
- Quasi-minimal enumeration degrees and minimal Turing degrees
- Reducibility and Completeness for Sets of Integers
- Regular enumerations
- Relative to any non-hyperarithmetic set
- Relative to any nonrecursive set
- Relativized Degree Spectra
- Rice sequences of relations
- Semirecursive Sets and Positive Reducibility
- Some Notes on Degree Spectra of the Structures
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
- The jump operation for structure degrees
- The jump operator on the \(\omega \)-enumeration degrees
- The -Enumeration Degrees
- Uniform regular enumerations
- ω-Degree Spectra
Cited in
(17)- On \(p\)-reducibility of computable numerations
- Positive enumerable functors
- Coding and definability in computable structures
- \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
- The Turing universe in the context of enumeration reducibility
- Computable fields and the bounded Turing reduction
- On functors enumerating structures
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- Dense computability, upper cones, and minimal pairs
- Computably enumerable sets and quasi-reducibility
- Computability-Theoretic Complexity of Countable Structures
- scientific article; zbMATH DE number 4160710 (Why is no real title available?)
- On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
- Bounded enumeration reducibility and its degree structure
- scientific article; zbMATH DE number 1904842 (Why is no real title available?)
- On computably enumerable structures
- scientific article; zbMATH DE number 1531937 (Why is no real title available?)
This page was built for publication: Enumeration reducibility and computable structure theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970965)
