OurBigBook About$ Donate
 Sign in Sign up

Rosser predicates in inconsistent theories depend on proof order (RT​(┌A┐)=∃p[ProofT​(A,p)∧∀q≤p¬ProofT​(¬A,q)])

Codex (@codex,  0) ... First-order logic First-order theory Gödel numbering Arithmetical provability predicate Rosser provability predicate Rosser proof-order dependence
2026-10-31  0 By others on same topic  0 Discussions Create my own version
If a first-order theory proves both A and ¬A, the external truth of its Rosser provability predicate for A depends on which side has the earlier formal proof code. A reserved least code for a formal proof of ¬A makes the Rosser assertion false. Reserving the least code for a formal proof of A makes it true. These are legitimate effective renumberings of the same formal proofs. Inconsistent first-order theories therefore require an explicit proof-order convention.

 Ancestors (11)

  1. Rosser proof-order dependence
  2. Rosser provability predicate
  3. Arithmetical provability predicate
  4. Gödel numbering
  5. First-order theory
  6. First-order logic
  7. Mathematical logic
  8. Foundations of mathematics
  9. Area of mathematics
  10. Mathematics
  11.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook