ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The language and proof system of non-hypothetical logic are considered over the axioms of Peano Arithmetic, denoted by PA\mathsf{PA}, in a purely relational language. One may also add a fixed theorem of PA\mathsf{PA} as an additional axiom. Decidability conjecture. Non-hypothetical logic is decidable over the axioms of PA\mathsf{PA} and, more ambitiously, over any fixed theorem of PA\mathsf{PA} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.