On the metamathematics of the P vs. NP question (Q2383632): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and incompleteness in classical mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of an exotic definition for \(\text{P}=\text{NP}\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4822150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the metamathematics of the P vs. NP question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's Tenth Problem is Unsolvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfinite recursive progressions of axiomatic theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Expressiveness of Simple and Second-Order Type Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfinite Progressions: A Second Look at Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General recursive functions of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Interpretation of Non-Finitist Proofs--Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concepts of completeness and interpretation of formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ramsey theorem in Boyer-Moore logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic polynomial-time computations and models of arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical number theory I. An introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: P, NP, Co-NP and weak systems of arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397036 / rank
 
Normal rank

Revision as of 14:52, 26 June 2024

scientific article
Language Label Description Also known as
English
On the metamathematics of the P vs. NP question
scientific article

    Statements

    On the metamathematics of the P vs. NP question (English)
    0 references
    0 references
    0 references
    19 September 2007
    0 references
    The unresolved issue under consideration is whether \(\text{P}=\text{NP}\) and/or its negation is consistent with, say, ZFC. This paper surveys, comments upon, and sometimes reformulates work that has been done on this topic over the last thirty years. Particular attention is given to contributions of da~Costa and Doria themselves.
    0 references
    \(\text{P}=\text{NP}\)
    0 references
    consistency
    0 references
    independence
    0 references
    Peano arithmetic
    0 references
    Zermelo-Fraenkel set theory
    0 references

    Identifiers

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