Degree Structures: Local and Global Investigations (Q3412461): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recursion theory and complexity. Proceedings of the Kazan '97 workshop, Kazan, Russia, July 14--19, 1997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump embeddings in the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definable degrees and automorphisms of 𝒟 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of embeddings in the computably enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic aspects of the computably enumerable degrees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Kleene and Post / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order theory of the degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A splitting theorem for $n-REA$ degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining the Turing jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: The jump is definable in the structure of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneity and definability in the first-order theory of the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal degrees and the jump operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees have infinitely many one-types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and 1-types in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice embeddings into the recursively enumerable degrees. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive Initial Segments of the Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impossibility of finding relative complements for recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper semi-lattice of degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Initial Segments of The Turing Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>Σ</i><sub>2</sub>-theory of the upper semilattice of Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice embeddings into the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Embeddings into the R.E. Degrees Preserving 0 and 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The homogeneity conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inspheres and inner products / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees less than 0' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every finite lattice is embeddable in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal degree less than 0’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretability and Definability in the Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility orderings: Theories, definability and automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding jump upper semilattices into the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ∀∃-theory of ℛ(≤,∨,∧) is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial segments of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Priority Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility / rank
 
Normal rank

Latest revision as of 09:52, 25 June 2024

scientific article
Language Label Description Also known as
English
Degree Structures: Local and Global Investigations
scientific article

    Statements

    Degree Structures: Local and Global Investigations (English)
    0 references
    0 references
    6 December 2006
    0 references
    Turing degree structures
    0 references
    recursively enumerable degrees
    0 references
    halting problem
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references