2000 character limit reached
The $Σ_1$-Provability Logic of HA*
Published 12 May 2018 in math.LO | (1805.06763v3)
Abstract: For the Heyting Arithmetic HA, HA* is defined as the theory ${A\mid {\sf HA}\vdash A{\Box}}$, where $A{\Box}$ is called the box translation of $A$. We characterize the $\Sigma_1$-provability logic of HA* as a modal theory ${\sf iH}_\sigma*$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.