Nontriviality of number-restricted arithmetic over subDMQ
Statement
Weber's programme of paraconsistent mathematics keeps unrestricted comprehension and revises the logic of inference so that contradictions do not make every statement provable. Ripley and Weber's 2026 proposal restricts induction to numbers as part of a strategy for blocking paradox, and Ripley's presentation of it records that the resulting theory is not known to be trivial, the programme working "without a net: no nontriviality proofs". Is number-restricted arithmetic over subDMQ nontrivial: does it, together with naive comprehension and induction over the combined language, avoid proving everything?
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.