Enumeration Reducibility and Computable Structure Theory (Q2970965): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mariya Ivanova Soskova / rank
Normal rank
 
Property / author
 
Property / author: Mariya Ivanova Soskova / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2559125440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of enumeration reducibility using recursive infinitary propositional sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic copies of countable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The jump operation for structure degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining totality in the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration reducibility and partial degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective model theory vs. recursive model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Set has a Least Jump Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility and Completeness for Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Pair Theorem for the ω-Enumeration Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the Local Theory of the ω-Enumeration Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The jump operator on the \(\omega \)-enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpreting true arithmetic in the local structure of the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability via Kalimullin pairs in the structure of the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Categorical Theories with Computable Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerations in computable structure theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: RELATIVE TO ANY NON-HYPERARITHMETIC SET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $n$-back-and-forth types of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Notes on Degree Spectra of the Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration Degrees and Enumerability of Familes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees coded in jumps of orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5623672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metarecursive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non <i>Σ</i><sub><i>n</i></sub> axiomatizable almost strongly minimal theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumps of quasi-minimal enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on the Jump of a Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rice sequences of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computable ℵ<sub>0</sub>-categorical structure whose theory computes true arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract First Order Computability. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Computability and Invariant Definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Degrees of Partial Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical Reducibilities I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to any nonrecursive set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-minimal enumeration degrees and minimal Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability via enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4299168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability by means of effectively definable schemes and definability via enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A jump inversion theorem for the enumeration jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform regular enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The  -Enumeration Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on ω-Jump Inversion of Degree Spectra of Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective properties of Marker's extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized Degree Spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jump Inversion Theorem for the Degree Spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: ω-Degree Spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jump Inversion Theorem for the Degree Spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-minimal degrees for degree spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding countable partial orderings in the enumeration degrees and the  -enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A jump inversion theorem for the semilattices of \(\Sigma\)-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative Extensions of Abstract Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Jump Inversion Theorem for Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerations, countable structures and Turing degrees / rank
 
Normal rank

Latest revision as of 15:41, 13 July 2024

scientific article
Language Label Description Also known as
English
Enumeration Reducibility and Computable Structure Theory
scientific article

    Statements

    Enumeration Reducibility and Computable Structure Theory (English)
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    enumeration reducibility
    0 references
    enumeration jump
    0 references
    degree spectra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers