3 papers
cs.CC2026
Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption
Hunter Monroe
Monroe (2026) shows that, if no optimal proof system exists, then every sound arithmetic theory S extending S^1_2 with polynomial-time decidable axioms fails, for all sufficiently…
cs.CC2026
Toward a Characterization of Simulation Between Arithmetic Theories
Hunter Monroe
We study when a sound arithmetic theory with polynomial-time decidable axioms efficiently proves the bounded consistency statements $Con_{\mathcal S+ϕ}(…
cs.CC2025
A Proposed Characterization of p-Simulation Between Theories
Hunter Monroe
This paper proposes a characterization of when one axiomatic theory, as a proof system for tautologies, -simulates another, by showing: (i)~if c.e. theory efficien…