English

Free Heyting Algebra Endomorphisms: Ruitenburg's Theorem and Beyond

Logic 2019-01-08 v1 Logic in Computer Science

Abstract

Ruitenburg's Theorem says that every endomorphism f of a finitely generated free Heyting algebra is ultimately periodic if f fixes all the generators but one. More precisely, there is N \ge 0 such that f N +2 = f N , thus the period equals 2. We give a semantic proof of this theorem, using duality techniques and bounded bisimulation ranks. By the same techniques, we tackle investigation of arbitrary endomorphisms between free algebras. We show that they are not, in general, ultimately periodic. Yet, when they are (e.g. in the case of locally finite subvarieties), the period can be explicitly bounded as function of the cardinality of the set of generators.

Keywords

Cite

@article{arxiv.1901.01252,
  title  = {Free Heyting Algebra Endomorphisms: Ruitenburg's Theorem and Beyond},
  author = {Silvio Ghilardi and Luigi Santocanale},
  journal= {arXiv preprint arXiv:1901.01252},
  year   = {2019}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1804.06130

R2 v1 2026-06-23T07:03:27.837Z