Decidability conjecture for non-hypothetical logic over Peano Arithmetic
Statement
The language and proof system of non-hypothetical logic are considered over the axioms of Peano Arithmetic, denoted by , in a purely relational language. One may also add a fixed theorem of as an additional axiom. Decidability conjecture. Non-hypothetical logic is decidable over the axioms of and, more ambitiously, over any fixed theorem of taken as an additional axiom. The paper defends these conjectures by drafting an algorithm for deciding the former; the supplied text does not establish whether either conjecture is resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.