Article Title：On modal μ-calculus and non-well-founded set theory
Abstract：
A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal mu-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new interlinks between automata theory and non-well-founded sets.
Keywords: alternating tree automata; bisimulation; modal m-calculus; non-well-founded sets; transition systems
DOI: 10.1023/B:LOGI.0000036771.59434.71
Source：JOURNAL OF PHILOSOPHICAL LOGIC
Welcome to correct the error, please contact email: humanisticspider@gmail.com
