Fixed-point logics, generalized quantifiers, and oracles
The paper deals with problems concerning the representation of fixed-point logics and their extensions by means of generalized quantifiers. E.g., it is shown that: \(\bullet\) the class \(Q_{\text{MC}}\) of monotone circuits is complete for IFP with respect to quantifier-free reductions, in particular, \(\text{IFP} \equiv \text{FO} (Q_{\text{MC}})\); \(\bullet\) for every quantifier \(Q\) there is a quantifier \(Q'\) such that \(\text{IFP} (Q) \equiv \text{FO} (Q')\); \(\bullet\) if \(\text{FO} (Q)\equiv \text{IFP}\) then there is a quantifier \(Q_1\) such that \(\text{FO} (Q,Q_1) <\text{IFP} (Q_1)\) (even on ordered structures).
- Fixed-point extensions of first-order logic
- Guarded quantification in least fixed point logic
- scientific article; zbMATH DE number 1043779 (Why is no real title available?)
- Enhancing fixed point logic with cardinality quantifiers
- Incorporating generalised quantifiers and the least fixed point operator
- scientific article; zbMATH DE number 1795986 (Why is no real title available?)
- Generalized Quantifiers and Logical Reducibilities
This page was built for publication: Fixed-point logics, generalized quantifiers, and oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344700)