Derivability conditions on Rosser's provability predicates
As the author states, this is a complement to a paper by \textit{D. Guaspari} and \textit{R. M. Solovay} [Ann. Math. Logic 16, 81-99 (1979; Zbl 0426.03062)]: the author considers Rosser sentences in the milieu of PRA \((=\) open induction with parameters for primitive recursive functions), while Guaspari and Solvay did so in Peano arithmetic. For a provability predicate \(P(a):=\exists y\theta (y,a)\), the associated Rosser predicate R(a) is defined to be \(\exists y(\theta (y,a)\&\forall z\leq y\neg \theta (z,\neg a))\). [Here and below, Gödel numbering and the like are suppressed.] Given a provability predicate P(a) that satisfies (*) \(\vdash \forall formula x,y[P(x\to y)\to P(x)\to P(y)]\) (`\(\vdash '\) for `PRA\(\vdash ')\), and two other reasonable conditions, the author constructs other predicates \(P_ 1\) and \(P_ 2\) that are equivalent to P, i.e. \(\vdash \forall formula P(x)\leftrightarrow P_ 1(x)\leftrightarrow P_ 2(x)\), and such that their Rosser versions \(R_ 1\) and \(R_ 2\) have the following properties: (*) holds for \(R_ 1\) in place of P, and for \(R_ 2\) (**) \(\vdash \forall formula x[R_ 2(x)\to R_ 2(R_ 2(x))]\). (Of course, neither \(R_ 1\) nor \(R_ 2\) can satisfy both (*) and (**).) The author's construction of these predicates is intricate, but straightforward. Unlike Guaspari and Solovay, he does not go into modality considerations.
- Generic generalized Rosser fixed points
- scientific article; zbMATH DE number 5157044
- Rosser provability and the second incompleteness theorem
- Rosser orderings and free variables
- Rosser and Mostowski sentences
- Arithmetic analogues of McAloon's unique Rosser sentences
- Universal Rosser predicates
- On Rosser's Provability Predicate
- Yablifying the Rosser sentence
- A simplification of a completeness proof of Guaspari and Solovay
- A note on some extension results
- Rosser provability and the second incompleteness theorem
- Rosser provability and normal modal logics
- A remark on equivalent Rosser sentences
- What's so special about the Gödel sentence \(\mathcal{G}\)?
- Current research on Gödel's incompleteness theorems
- On Rosser's Provability Predicate
- An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
- Universal Rosser predicates
- A note on derivability conditions
- Arithmetical completeness theorems for monotonic modal logics
- On the conservation results for local reflection principles
- Passive induction and a solution to a Paris-Wilkie open question
- Henkin sentences and local reflection principles for Rosser provability
This page was built for publication: Derivability conditions on Rosser's provability predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641298)
