Degree Structures: Local and Global Investigations (Q3412461)

From MaRDI portal

Revision as of 06:13, 21 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Degree Structures: Local and Global Investigations (English)

0 references

Richard A. Shore

0 references

Bulletin of Symbolic Logic

0 references

publication date

6 December 2006

0 references

full work available at URL

https://semanticscholar.org/paper/6f34e083bc9196db3b27e0f8e8b0dd104f2d2768

0 references

zbMATH Keywords

Turing degree structures

0 references

recursively enumerable degrees

0 references

halting problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

Recursion theory and complexity. Proceedings of the Kazan '97 workshop, Kazan, Russia, July 14--19, 1997

0 references

Jump embeddings in the Turing degrees

0 references

Definable degrees and automorphisms of 𝒟

0 references

A minimal pair of recursively enumerable degrees

0 references

The undecidability of the recursively enumerable degrees

0 references

On degrees of recursive unsolvability

0 references

Extension of embeddings in the computably enumerable degrees

0 references

Algebraic aspects of the computably enumerable degrees.

0 references

TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

0 references

On a Conjecture of Kleene and Post

0 references

First-order theory of the degrees of recursive unsolvability

0 references

A splitting theorem for $n-REA$ degrees

0 references

Defining the Turing jump

0 references

The jump is definable in the structure of the degrees of unsolvability

0 references

On homogeneity and definability in the first-order theory of the Turing degrees

0 references

Minimal degrees and the jump operator

0 references

The recursively enumerable degrees have infinitely many one-types

0 references

Undecidability and 1-types in the recursively enumerable degrees

0 references

Lattice embeddings into the recursively enumerable degrees. II

0 references

Distributive Initial Segments of the Degrees of Unsolvability

0 references

The impossibility of finding relative complements for recursively enumerable degrees

0 references

The upper semi-lattice of degrees of recursive unsolvability

0 references

Local Initial Segments of The Turing Degrees

0 references

On the <i>Σ</i><sub>2</sub>-theory of the upper semilattice of Turing degrees

0 references

Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

0 references

Lattice embeddings into the recursively enumerable degrees

0 references

Lattice Embeddings into the R.E. Degrees Preserving 0 and 1

0 references

The homogeneity conjecture

0 references

Inspheres and inner products

0 references

The recursively enumerable degrees are dense

0 references

On the degrees less than 0'

0 references

Degrees of Unsolvability. (AM-55)

0 references

Not every finite lattice is embeddable in the recursively enumerable degrees

0 references

A minimal degree less than 0’

0 references

Interpretability and Definability in the Recursively Enumerable Degrees

0 references

PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES

0 references

Reducibility orderings: Theories, definability and automorphisms

0 references

Embedding jump upper semilattices into the Turing degrees

0 references

The ∀∃-theory of ℛ(≤,∨,∧) is undecidable

0 references

The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical

0 references

A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees

0 references

0 references

Initial segments of the degrees of unsolvability

0 references

The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable

0 references

A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees

0 references

The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations

0 references

A General Framework for Priority Arguments

0 references

The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.2178/BSL/1154698739

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3412461

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3412461&oldid=39309298"