Modal separation of fixpoint formulae
From MaRDI portal
Cites work
- A note on graded modal logic
- Alternation
- An introduction to description logic
- Decidability results for the boundedness problem
- Deciding the first levels of the modal alternation hierarchy by formula construction
- Finite-automaton aperiodicity is PSPACE-complete
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 1304338 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 7058469 (Why is no real title available?)
- scientific article; zbMATH DE number 3368607 (Why is no real title available?)
- In so many possible worlds
- Invisible pushdown languages
- Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
- On finite monoids having only trivial subgroups
- On the lattice of extensions of the modal logics \(KAlt_ n\)
- On the succinctness of some modal logics
- Propositional dynamic logic of regular programs
- Results on the propositional \(\mu\)-calculus
- Separating regular languages with first-order logic
- The complexity of boundedness for guarded logics
- The complexity of propositional linear temporal logics
- Undecidable boundedness problems for datalog programs
This page was built for publication: Modal separation of fixpoint formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287794)
