Tagged Questions
3
votes
1answer
70 views
properties of the provability predicate applied to open formulas
Good day!
Let $\mathrm{T}$ be a first-order theory which contains the Peano arithmetic and has a recursively enumerable set of axioms. It is well known that one can construct a predicate ...
0
votes
1answer
95 views
Why isn't GL system of provability logic reflexive?
Formula $\square p \rightarrow p$ (axiom T; corresponding to reflexive modal frames) is interpreted as "if p is provable, then p", or more precisely: for all realizations (all substitutions for $p$), ...
0
votes
0answers
101 views
Uniqueness of super godel numbers of $\varphi$ and $\neg \varphi$
Let $e_{0},e_{1},...,e_{n}$ be a sequence of wffs or other expressions. Code each $e_{i}$ by a regular godel number $g_{i}$, to yield a sequence of numbers $g_{0},g_{1},...,g_{n}$. Then encode this ...
