Arity and alternation in second-order logic

This publication has 11 references indexed in Scilit:

• Bounded-arity hierarchies in fixed-point logics
  Published by Springer Nature ,2006
• Computable Quantifiers and Logics over Finite Structures
  Published by Springer Nature ,1995
• A regular characterization of graph languages definable in monadic second-order logic
  Theoretical Computer Science, 1991
• Reachability is harder for directed than for undirected finite graphs
  The Journal of Symbolic Logic, 1990
• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• A Catalog of Complexity Classes
  Published by Elsevier ,1990
• Second-order and Inductive Definability on Finite Structures
  Mathematical Logic Quarterly, 1987
• Classifying regular events in symbolic logic
  Journal of Computer and System Sciences, 1982
• Complexity classes and theories of finite models
  Theory of Computing Systems, 1981
• Weak Second‐Order Arithmetic and Finite Automata
  Mathematical Logic Quarterly, 1960