Communication Dans Un Congrès Année : 2025

Monad Translations for Higher-Order Logic

Résumé

Classical logic can be embedded into intuitionistic logic by inserting double negations in formulas. Several translations generalize this idea by using monad operators instead of double negations. They eliminate particular axioms, for instance the principle of excluded middle or the principle of explosion, and therefore can be used to embed classical logic into intuitionistic logic or intuitionistic logic into minimal logic. Such translations have been defined for first-order logic. In this paper, we define a translation, parameterized by monad operators, for higher-order logic. In particular, the property that any formula and its translation are equivalent in the presence of the eliminated axiom holds under functional extensionality and propositional extensionality. We apply this translation to embed higher-order classical (respectively intuitionistic) logic into higher-order intuitionistic (respectively minimal) logic. By adapting Friedman’s trick, we show that coherent formulas correspond to a constructive fragment of higher-order classical logic, meaning that we can transform classical proofs into intuitionistic proofs without modifying the proven statements.

Fichier principal
Vignette du fichier
LIPIcs.FSCD.2025.34.pdf (736.84 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-05151149 , version 1 (08-07-2025)

Licence

Identifiants

Citer

Thomas Traversié. Monad Translations for Higher-Order Logic. FSCD 2025 - 10th International Conference on Formal Structures for Computation and Deduction, Maribel Fernández, Jul 2025, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2025.34⟩. ⟨hal-05151149⟩
496 Consultations
285 Téléchargements

Altmetric

Partager

  • More