Parikh's own work on feasible arithmetic shows that operationally motivated length restrictions require a fully rigorous alternative proof theory, not a reinterpretation of classical inconsistency.

?Rate how convincing each reason is below to see the overall strength.

No one has weighed in yet. Be the first to share reasons for or against this statement.

Classical inconsistency(as used in formal logic): The traditional logical problem where a system contains a statement and its opposite, making the entire system logically broken according to standard rules.
Feasible arithmetic(The field Parikh worked on): A branch of mathematics that deals with what computations are actually possible given real limits on time, memory, and resources—rather than theoretical limits.
Length restrictions(these require a new proof theory according to the statement): Limits on how long or complex mathematical proofs or numbers can be before they become practically impossible to work with.
Operationally motivated(describes the length restrictions being discussed): Based on what actually works in practice or what you can physically do, rather than what might be theoretically possible.

Based on where you are in your exploration