An Intuitionistic Formula Hierarchy Based on High-School Identities - Archive ouverte HAL Access content directly
Journal Articles Mathematical Logic Quarterly Year : 2019

An Intuitionistic Formula Hierarchy Based on High-School Identities

(1) , (1)
1

Abstract

We revisit intuitionistic proof theory from the point of view of the formula isomorphisms arising from high-school identities. Using a representation of formulas as exponential polynomials, we first observe that invertible proof rules of sequent calculi for intuitionistic proposition logic correspond to equations using high-school identities, and that hence a so called high-school variant of a proof system can be obtained that is complete for provability, but contains no more than the non-invertible proof rules. We further show that, for proof calculi that do not include contraction, like the G4ip sequent calculus of Vorob'ev, Hudelmaier, and Dyckhoff, it may also be possible to interpret the non-invertible rules as strict inequalities between exponential polynomials. Finally, we extend the exponential polynomial analogy to first-order quantifiers, showing that it gives rise to a simple intuitionistic hierarchy of formulas, the first one that classifies formulas up to isomorphism, and proceeds along the same equivalences that lead to the classical arithmetical hierarchy.
Fichier principal
Vignette du fichier
high-school.pdf (239.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01354181 , version 1 (17-08-2016)

Identifiers

Cite

Taus Brock-Nannestad, Danko Ilik. An Intuitionistic Formula Hierarchy Based on High-School Identities. Mathematical Logic Quarterly, 2019, 65 (1), pp.57-79. ⟨10.1002/malq.201700047⟩. ⟨hal-01354181⟩
139 View
108 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More