About this document
Toward A Characterization of Simulation Between Arithmetic Theories by akilmoussa404 is a document available to read on EtoBox.
The paper investigates the conditions under which a sound arithmetic theory S can efficiently prove the bounded consistency statements for true sentences independent of S. It presents two main contributions: a sufficient condition for simulation based on relative consistency and a demonstration that failure to simulate certain true sentences implies failure for related Busy Beaver functions. The central conjecture proposed is that failure of relative consistency leads to non-simulation, suggesting a structu
- Author
- akilmoussa404
- Language
- EN