Expressive equivalence of least and inflationary fixed-point logic
From MaRDI portal
Publication:1886320
DOI10.1016/J.APAL.2004.02.001zbMATH Open1052.03012OpenAlexW1983330347MaRDI QIDQ1886320FDOQ1886320
Authors: Stephan Kreutzer
Publication date: 18 November 2004
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2004.02.001
Recommendations
finite structuresexpressive powerfixed-point logicIFP-nesting depth hierarchyinfinite structuresLFP-alternation hierarchy
Cites Work
Cited In (11)
- Title not available (Why is that?)
- Logic and Game Theory
- On the descriptive complexity of temporal constraint satisfaction problems
- Title not available (Why is that?)
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- Symbioses between mathematical logic and computer science
- FO(ID) as an extension of DL with rules
- Automata, Languages and Programming
- On the expressive power of monadic least fixed point logic
- Canonisation and Definability for Graphs of Bounded Rank Width
- Title not available (Why is that?)
This page was built for publication: Expressive equivalence of least and inflationary fixed-point logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886320)