Second-Order Logic over Strings: Regular and Non-regular Fragments

@inproceedings{Eiter2001SecondOrderLO,
  title={Second-Order Logic over Strings: Regular and Non-regular Fragments},
  author={Thomas Eiter and Georg Gottlob and Thomas Schwentick},
  booktitle={Developments in Language Theory},
  year={2001}
}
By a well-known result due to Buchi and Trakhtenbrot, all monadic second-order sentences over words describe regular languages. In this paper, we investigate prefix classes of general second-order logic. Such a prefix class is called regular, if each of its sentences describes a regular language, and nonregular otherwise. Recently, the regular and nonregular prefix classes of existential secondorder logic ?11 were exhaustively determined. We briefly recall these results and continue this line… 

The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey

TLDR
This paper surveys results related to the model checking problem for second-order logic over classes of finite structures, including word structures, graphs, and trees, with a focus on prefix classes, that is, where all quantifiers are at the beginning of formulas.

Existential second-order logic over graphs: charting the tractability frontier

TLDR
A dichotomy holds, i.e., each prefix class of existential second-order logic either contains sentences that can express NP-complete problems or each of its sentences expresses a polynomial-time solvable problem.

A Restricted Second-Order Logic for Non-deterministic Poly-Logarithmic Time

TLDR
A Fagin's style theorem is proved showing that the Boolean queries which can be expressed in the existential fragment of second-order logic corresponds exactly to the class of decision problems that can be computed by a non-deterministic Turing machine with random access to the input in time.

Second-Order Logic over Finite Structures - Report on a Research Programme

  • G. Gottlob
  • Computer Science
    Electron. Notes Discret. Math.
  • 2004

An Attempt to Automate NP -Hardness Reductions via SO ∃ Logic

TLDR
The problem is motivated from an artificial intelligence perspective, then the use of second-order existential (SO∃) logic as representation language for decision problems is proposed and the possibility of implementing seven syntactic operators is explored, which each transforms SO∃ sentences in a way that preserves NP-completeness.

Regular Vacuity

TLDR
This work defines when a regular expression does not affect the satisfaction of an RELTL formula by means of universally quantified intervals, and argues for the generality of the definition and shows that regular-vacuity detection is decidable, but involves an exponential blow-up.

How to Prove that a Language Is Regular or Star-Free?

This survey article presents some standard and less standard methods used to prove that a language is regular or star-free.

Language and Automata Theory and Applications: 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings

TLDR
This work surveys recent developments related to the Minimum Circuit Size Problem and proposes a strategy to address the problem.

References

SHOWING 1-10 OF 24 REFERENCES

Existential second-order logic over graphs: charting the tractability frontier

TLDR
A dichotomy holds, i.e., each prefix class of existential second-order logic either contains sentences that can express NP-complete problems or each of its sentences expresses a polynomial-time solvable problem.

Existential second-order logic over strings

TLDR
This work completely characterizes the relationship between MSO and syntactic fragments of ESO, and determines the complexity of model checking over strings, for all ESO-prefix classes.

Generalized first-order spectra, and polynomial. time recognizable sets

The spectrum of a first-order sentence σ is the set of cardinalities of its finite models. Jones and Selman showed that a set C of numbers (written in binary) is a spectrum if and only if C is in the

Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems

Two-variable descriptions of regularity

  • E. GrädelEric Rosen
  • Computer Science
    Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
  • 1999
We prove that the class of all languages that are definable in /spl Sigma//sub 1//sup 1/(FO/sup 2/), that is, in (non-monadic) existential second-order logic with only two first-order variables,

Finite Automata, Formal Logic, and Circuit Complexity

TLDR
This book discusses words and languages automata and regular languages semigroups and homomorphisms, formal languages and formal logic, regular languages and circuit complexity, and proof of the Krohn-Rhodes theorem proofs of the category theorems.

Automata on Infinite Objects

  • W. Thomas
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

On a Decision Method in Restricted Second Order Arithmetic

Let SC be the interpreted formalism which makes use of individual variables t, x, y, z,... ranging over natural numbers, monadic predicate variables q( ), r( ), s( ), i( ),... ranging over arbitrary

On Finite Model Theory

The subject of this paper is the part of finite model theory intimately related to the classical model theory. In the very beginning of our career in computer science, we attended a few lectures on

Descriptive Characterizations of Computational Complexity

  • D. Leivant
  • Computer Science
    J. Comput. Syst. Sci.
  • 1989