Expressive equivalence of least and inflationary fixed-point logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 403-410

  Kreutzer, Stephan ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFLATIONARY FIXED-POINT (IFP) LOGICS;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; POLYNOMIALS; THEOREM PROVING;

FORMAL LOGIC;

EID: 0036053447     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2002.1029848     Document Type: Conference Paper

References (13)

1. An introduction to inductive definitions
2. The model μ-calculus alternation hierarchy is strict
3. Inflationary fixed points in modal logic
4. Fixed-point logics
5. Efficient model checking in fragments of the propositional mu-calculus
6. Fixed-point extensions of first-order logic
7. Relational queries computable in polynomial time
8. On non-monotone inductive definability
9. On fixed point clones
10. The complexity of relational query languages