P, NP, Co-NP and weak systems of arithmetic

DOI10.1016/0304-3975(95)00099-2zbMath0873.03038OpenAlexW1991368059MaRDI QIDQ672742

Claude Sureson

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00099-2

zbMATH Keywords

nonstandard models of arithmeticcomplexity classeslanguage of arithmeticpolynomial time computationsweak systems of arithmetic

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On the metamathematics of the P vs. NP question

Cites Work

• \(\text{NP}\not={co}\)-NP and models of arithmetic
• Non-standard models of Peano arithmetic
• NP-complete decision problems for binary quadratics
• Nondeterministic polynomial-time computations and models of arithmetic
• On models of arithmetic—Answers to two problems raised by H. Gaifman
• Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
• Existence and feasibility in arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: P, NP, Co-NP and weak systems of arithmetic