Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/mcs/Matiyasevich04, #quickstatements; #temporary_batch_1731508824982
 
(4 intermediate revisions by 4 users not shown)
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.1016/j.matcom.2004.05.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031689412 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56896664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Recursively Unsolvable Problems in Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Canonical Forms and Simplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical problems and recursively enumerable predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power series solutions of algebraic differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal diophantine equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Register machine proof of the theorem on exponential diophantine representation of enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Recursive Unsolvability of Hilbert's Tenth Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of some Problems Pertaining to Base 2 Exponential Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete decision problems for binary quadratics / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIOPHANTINE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct method for simulating partial recursive functions by Diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Diophantine Problem for Laurent Polynomial Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some undecidable problems involving elementary functions of a real variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical representation of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some representations of Diophantine sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zwei Unentscheidbare Probleme Der Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The model theory of ordered differential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Undecidability of the Existence of Zeros of Real Elementary Functions / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mcs/Matiyasevich04 / rank
 
Normal rank

Latest revision as of 15:59, 13 November 2024

scientific article
Language Label Description Also known as
English
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
scientific article

    Statements

    Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (English)
    0 references
    22 November 2004
    0 references
    Quantifier elimination
    0 references
    Diophantine equations
    0 references
    Davis conjecture
    0 references
    DPRM-theorem
    0 references
    Hilbert's tenth problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references