Is there a simple, pedestrian arithmetic sentence which is independent of ZFC?

DOI10.1023/A:1005244002066MaRDI QIDQ1840967zbMATH OpenOpenAlexFDO

Authors Francisco Antonio Doria

Publication date 13 September 2001

Published in Synthese (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005244002066

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Consistency and independence results (03E35) First-order arithmetic and fragments (03F30)

Recommendations

• On the metamathematics of the P vs. NP question
• Complexity classes as mathematical axioms
• Consequences of an exotic definition for \(\text{P}=\text{NP}\).
• Incompleteness in the finite domain
• Gödel sentences of bounded arithmetic

Cited in

(3)

• Complexity classes as mathematical axioms
• Consequences of an exotic definition for \(\text{P}=\text{NP}\).
• On the metamathematics of the P vs. NP question

This page was built for publication: Is there a simple, pedestrian arithmetic sentence which is independent of ZFC?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840967)