Logical definability of fixed points
- 30 November 1988
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 61 (2-3) , 289-297
- https://doi.org/10.1016/0304-3975(88)90129-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The greatest fixed-points and rational omega-tree languagesTheoretical Computer Science, 1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970