We show that examinations of the expressive power of logical formulae enriched by Lindström quantifiers over ordered finite structures have a well-studied complexity-theoretic counterpart: the leaf language approach to define complexity classes. Model classes of formulae with Lindström quantifiers are nothing else than leaf language definable sets. Along the way we tighten the best up to now kn...

This paper draws close connections between the ease of presenting a given complexity class C and the position of the index sets IC = f i : L(Mi) 2 C g and JC = f i : Mi is total ^ L(Mi) = 2 C g in the arithmetical hierarchy. For virtually all classes C studied in the literature, the lowest levels attainable are IC 2 P03 and JC 2 Q02; the rst holds i C is 02-presentable, and the second i C is re...

This paper de nes natural hierarchies of function and relation classes, constructed from parallel complexity classes in a manner analogous to the polynomial-time hierarchy. A number of structural results about these classes are proven: relationships between them and the levels of PH; relationships between these classes and de nability in the bounded arithmetic theoriesR k; and several results r...

We establish some relations between the class of truth-equational logics, the class of assertional logics, other classes in the Leibniz hierarchy, and the classes in the Frege hierarchy. We argue that the class of assertional logics belongs properly in the Leibniz hierarchy. We give two new characterizations of truth-equational logics in terms of their full generalized models, and use them to o...

The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concept class with polynomial query complexity can be learned in polynomial time with the help of an oracle in the polynomial hierarchy, where the complexity of the required oracle depends on the query-types used by the lear...

class Node class *Node extends Node 2.2.2 Blocks Nodes are grouped into basic blocks using a hierarchy of Block classes. The hierarchy is composed of five interfaces, two abstract classes, and four concrete classes. package org.checkerframework.dataflow.cfg.block;

The application of appropriate hierarchical structures is an efficient mechanism for improving the survivability and scalability of mobile ad hoc networks (MANETs). Due to network dynamics and infrastructureless character of MANET, however, the imposed hierarchy may harm the performance as the network environment evolves. This degradation can be prevented by adapting the hierarchy to the new ne...

One of the objectives of the U.S. Department of Defense is to standardize all classes used in objectoriented deployment simulations by developing a standard class attribute representation and behavior for all deployment simulations that rely on an underlying class representation. The EXtensive Hierarchy and Object Representation for Transportation Simulations (EXHORT) is a class framework compo...