Enumeration Reducibility and Computable Structure Theory
From MaRDI portal
Publication:2970965
DOI10.1007/978-3-319-50062-1_19zbMath1485.03118OpenAlexW2559125440MaRDI QIDQ2970965
Alexandra Soskova, Mariya Ivanova Soskova
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_19
Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Generic copies of countable structures
- Generalizations of enumeration reducibility using recursive infinitary propositional sentences
- Elementary induction on abstract structures
- Computability by means of effectively definable schemes and definability via enumerations
- Quasi-minimal enumeration degrees and minimal Turing degrees
- Computable structures and the hyperarithmetical hierarchy
- A jump inversion theorem for the enumeration jump
- A jump inversion theorem for the semilattices of \(\Sigma\)-degrees
- Enumerations in computable structure theory
- RELATIVE TO ANY NON-HYPERARITHMETIC SET
- Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees
- Rice sequences of relations
- Conservative Extensions of Abstract Structures
- On the $n$-back-and-forth types of Boolean algebras
- Every Set has a Least Jump Enumeration
- Note on Degrees of Partial Functions
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
- Uniform regular enumerations
- Non Σn axiomatizable almost strongly minimal theories
- Definability via enumerations
- ω-Degree Spectra
- A computable ℵ0-categorical structure whose theory computes true arithmetic
- Definability in the Local Theory of the ω-Enumeration Degrees
- Notes on the Jump of a Structure
- Enumeration Degrees and Enumerability of Familes
- A Jump Inversion Theorem for the Degree Spectra
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Jumps of quasi-minimal enumeration degrees
- Degrees coded in jumps of orderings
- Reducibility and Completeness for Sets of Integers
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Regular enumerations
- Degrees of Structures
- Interpreting true arithmetic in the local structure of the enumeration degrees
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- A Note on ω-Jump Inversion of Degree Spectra of Structures
- Another Jump Inversion Theorem for Structures
- Quasi-minimal degrees for degree spectra
- Effective properties of Marker's extensions
- Exact Pair Theorem for the ω-Enumeration Degrees
- Some Notes on Degree Spectra of the Structures
- A Jump Inversion Theorem for the Degree Spectra
- The -Enumeration Degrees
- Relativized Degree Spectra
- Complexity of Categorical Theories with Computable Models
- Metarecursive sets
- Semirecursive Sets and Positive Reducibility
- A note on the hyperarithmetical hierarchy
- Abstract First Order Computability. I
- Abstract Computability and Invariant Definability
- Enumeration reducibility and partial degrees
- Arithmetical Reducibilities I
- New Computational Paradigms
- Defining totality in the enumeration degrees
- Effective model theory vs. recursive model theory
- Logical Approaches to Computational Barriers
This page was built for publication: Enumeration Reducibility and Computable Structure Theory
