Finite-Degree Predicates and Two-Variable First-Order Logic

  title={Finite-Degree Predicates and Two-Variable First-Order Logic},
  author={Charles Paperman},
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only. From this result we derive the separation of the alternation hierarchy of two-variable logic on this signature. 

Figures from this paper

A crevice on the Crane Beach: Finite-degree predicates

First-order logic (FO) over words is shown to be equiexpressive with FO equipped with a restricted set of numerical predicates, namely the order, a binary predicate MSB<inf>0</inf>, and the



Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable

It is shown that it is decidable for a given regular language and a non-negative integer m, whether the language is definable by a formula in FO^2[<,suc] which has at most m quantifier alternations.

An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic

An algebraic characterization, based on the bilateral semidirect product of finite monoids, of the quantifier alternation hierarchy in two-variable first-order logic on finite words is given and a new proof that this hierarchy is strict is obtained.

Definability of Languages by Generalized First-Order Formulas over N+

It is shown that if the only available numerical predicate is addition, then sentences in this logic cannot define the set of bit strings in which the number of 1's is divisible by a prime that does not divide $q$.

Languages that Capture Complexity Classes

  • N. Immerman
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1987
It is shown that projection translations are a uniform version of Valiant’s projections, and that the usual complete problems remain complete via these very restrictive reductions.

Non-definability of Languages by Generalized First-order Formulas over (N,+)

It is shown that all languages with a neutral letter, definable using the addition predicate are also definable with the order predicate as the only numerical predicate, and it is proved that L and L define the same neutral letter languages.

Structure Theorem and Strict Alternation Hierarchy for FO2 on Words

This work proves precise structure theorems that characterize the exact expressive power of first-order logic with two variables on words, and proves, among other results, that there is a strict hierarchy of alternating quantifiers for both languages.

The FO^2 alternation hierarchy is decidable

It is shown that there are many different ways of climbing up the FO2[<]-quantifier alternation hierarchy: deterministic and co-deterministic products, Mal'cev products with definite and reverse definite semigroups, iterated block products with J-trivial monoids, and some inductively defined omega-term identities.

Parity, circuits, and the polynomial-time hierarchy

A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function and connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.

On a Problem of Formal Logic

This paper is primarily concerned with a special case of one of the leading problems of mathematical logic, the problem of finding a regular procedure to determine the truth or falsity of any given