Journal of Philosophical Logic 33 (4):343-360 (2004)
A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-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
|Categories||categorize this paper)|
References found in this work BETA
Citations of this work BETA
No citations found.
Similar books and articles
Are There Ultimately Founded Propositions?Gregor Damschen - 2010 - Universitas Philosophica 54 (54):163-177.
A Modal Sequent Calculus for a Fragment of Arithmetic.G. Sambin & S. Valentini - 1980 - Studia Logica 39 (2-3):245-256.
On the Modal Definability of Simulability by Finite Transitive Models.Fernández Duque David - 2011 - Studia Logica 98 (3):347-373.
The Modal Object Calculus and its Interpretation.Edward N. Zalta - 1997 - In M. de Rijke (ed.), Advances in Intensional Logic. Kluwer Academic Publishers. pp. 249--279.
Added to index2009-01-28
Total downloads49 ( #105,934 of 2,164,555 )
Recent downloads (6 months)2 ( #188,392 of 2,164,555 )
How can I increase my downloads?