On the strictness of the quantifier structure hierarchy in first-order logic
We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of Ehrenfeucht-Fraisse games that characterizes quantifier classes and use it to...
Main Author: | Yuguo He |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2014-11-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/965/pdf |
Similar Items
-
On the Mints Hierarchy in First-Order Intuitionistic Logic
by: Aleksy Schubert, et al.
Published: (2017-04-01) -
The recursion hierarchy for PCF is strict
by: John Longley
Published: (2018-08-01) -
Capturing the polynomial hierarchy by second-order revised Krom logic
by: Kexu Wang, et al.
Published: (2023-07-01) -
Monadic Second Order Logic with Measure and Category Quantifiers
by: Matteo Mio, et al.
Published: (2018-04-01) -
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic
by: Sandra Kiefer, et al.
Published: (2019-05-01)