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
On the phase space approach to complexity
β Scribed by Hans C. Fogedby
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 659 KB
- Volume
- 69
- Category
- Article
- ISSN
- 0022-4715
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the basic representation of complex systems by probabilistic weighted, connected, directed acyclic graphs we discuss Zipf's law and the possibility of obtaining the critical complexities for the evolution of complex systems. The speculation for the critical complexity per feature in respect to th
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.