Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers in first-order logic with linear order. Ou
✦ LIBER ✦
A descriptive complexity approach to the linear hierarchy
✍ Scribed by Yassine Hachaı̈chi
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 204 KB
- Volume
- 304
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
This paper gives some new logical characterizations of the class of rudimentary languages in the scope of descriptive complexity. These characterizations are based on a logic introduced by Parigot and Pelz to characterize Petri Net languages, and generalized quantiÿers of comparison of cardinality.
📜 SIMILAR VOLUMES
The Descriptive Complexity Approach to L
✍
Clemens Lautemann; Pierre McKenzie; Thomas Schwentick; Heribert Vollmer
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 235 KB
A utility approach to the analytic hiera
✍
F. Zahedi
📂
Article
📅
1987
🏛
Elsevier Science
⚖ 653 KB
A combinatorial approach to complexity
✍
P. Pudlák; V. Rödl
📂
Article
📅
1992
🏛
Springer-Verlag
🌐
English
⚖ 276 KB
A note on the descriptive complexity of
✍
Pierluigi Crescenzi; Riccardo Silvestri
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 375 KB
A weighted-gradient approach to multi-ob
✍
Ami Arbel
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 969 KB
A combinatorial approach to probabilisti
✍
Harald Niederreiter
📂
Article
📅
1990
🏛
Springer
🌐
English
⚖ 339 KB