Communication Dans Un Congrès Année : 2018

Ruitenburg's Theorem via Duality and Bounded Bisimulations

Résumé

For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A _i | i≥1} by letting A_1 be A and A_{i+1} be A(A_i/x). Ruitenburg's Theorem [8] says that the sequence { A _i } (modulo logical equivalence) is ultimately periodic with period 2, i.e. there is N ≥ 0 such that A N+2 ↔ A N is provable in intuitionistic propositional calculus. We give a semantic proof of this theorem, using duality techniques and bounded bisimulations ranks.

Fichier principal
Vignette du fichier
0.pdf (171.7 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01766636 , version 1 (13-04-2018)

Licence

Identifiants

Citer

Luigi Santocanale, Silvio Silvio.Ghilardi@unimi.It Ghilardi. Ruitenburg's Theorem via Duality and Bounded Bisimulations. Advances in Modal Logic, Aug 2018, Bern, Switzerland. ⟨hal-01766636⟩
203 Consultations
143 Téléchargements

Altmetric

Partager

  • More