Fixed-point logics, generalized quantifiers, and oracles (Q4344700)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1036293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed-point logics, generalized quantifiers, and oracles |
scientific article; zbMATH DE number 1036293 |
Statements
Fixed-point logics, generalized quantifiers, and oracles (English)
0 references
28 January 1998
0 references
oracles
0 references
representation of fixed-point logics
0 references
generalized quantifiers
0 references
monotone circuits
0 references
0.8170520663261414
0 references
0.7947083115577698
0 references
0.7914673089981079
0 references
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).
0 references