Free Heyting Algebra Endomorphisms: Ruitenburg's Theorem and Beyond

01/04/2019
by   Silvio Ghilardi, et al.
0

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 > 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.

READ FULL TEXT
research
04/17/2018

Ruitenburg's Theorem via Duality and Bounded Bisimulations

For a given intuitionistic propositional formula A and a propositional v...
research
11/15/2019

Some remarks regarding finite bounded commutative BCK-algebras

In this chapter, starting from some results obtained in the papers [FV; ...
research
03/26/2021

Palindromic Length and Reduction of Powers

Given a nonempty finite word v, let PL(v) be the palindromic length of v...
research
06/26/2019

On free completely iterative algebras

For every finitary set functor F we demonstrate that free algebras carry...
research
09/13/2023

Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract)

A classical theorem states that the set of languages given by a pushdown...
research
07/23/2018

Undecidability of MSO+"ultimately periodic"

We prove that MSO on ω-words becomes undecidable if allowing to quantify...
research
01/14/2023

Isolating Bounded and Unbounded Real Roots of a Mixed Trigonometric-Polynomial

Mixed trigonometric-polynomials (MTPs) are functions of the form f(x,sin...

Please sign up or login with your details

Forgot password? Click here to reset