On modal μ-calculus and non-well-founded set theory

Journal of Philosophical Logic 33 (4):343-360 (2004)
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 μ-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 Philosophy
Categories (categorize this paper)
DOI 10.1023/B:LOGI.0000036771.59434.71
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,215
Through your library
References found in this work BETA
Non-Well-Founded Sets.Peter Aczel - 1988 - Csli Lecture Notes.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Are There Ultimately Founded Propositions?Gregor Damschen - 2010 - Universitas Philosophica 54 (54):163-177.
∑1 Definitions with Parameters.T. A. Slaman - 1986 - Journal of Symbolic Logic 51 (2):453 - 461.
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.
Anti-Admissible Sets.Jacob Lurie - 1999 - Journal of Symbolic Logic 64 (2):407-435.

Monthly downloads

Added to index

2009-01-28

Total downloads

49 ( #105,934 of 2,164,555 )

Recent downloads (6 months)

2 ( #188,392 of 2,164,555 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums