1 problem

Decidability conjecture for non-hypothetical logic over Peano Arithmetic
The language and proof system of non-hypothetical logic are considered over the axioms of Peano Arithmetic, denoted by $\mathsf{PA}$ , in a purely relational language. One may also…
opendecidability logic peano-arithmetic
0 responses
06

Decidability conjecture for non-hypothetical logic over Peano Arithmetic