The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1032631
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Russell G. Miller / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomparable prime ideals of recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding finite lattices into the ideals of computably enumerable turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability: structure and theory / 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: The undecidability of the recursively enumerable 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: The upper semi-lattice of degrees of recursive 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: Distributive Initial Segments of the Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursively enumerable degree which will not split over all lesser ones / 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: Initial segments of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / 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: Decidability and Invariant Classes for Degree Structures / 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: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3234158 / 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: Q3125203 / 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: Recursive Enumerability and the Jump Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of the Degrees below <b>0</b> ′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934281 / 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: Extension of embeddings in the computably enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Degrees of Index Sets / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0002-9947-03-03406-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1956375874 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article; zbMATH DE number 2091190
Language Label Description Also known as
English
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
scientific article; zbMATH DE number 2091190

    Statements

    The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2004
    0 references
    recursively enumerable degree
    0 references
    computably enumerable degree
    0 references
    decidability
    0 references
    undecidability
    0 references
    Turing reducibility
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers