First order formulas with modular predicates
نویسندگان
چکیده
Two results by Schützenberger (1965) and by McNaughton and Papert (1971) lead to a precise description of the expressive power of first order logic on words interpreted as ordered colored structures. In this paper, we study the expressive power of existential formulas and of Boolean combinations of existential formulas in a logic enriched by modular numerical predicates. We first give a combinatorial description of the corresponding regular languages, and then give an algebraic characterization in terms of their syntactic morphisms. It follows that one can effectively decide whether a given regular language is captured by one of these two fragments of first order logic. The proofs rely on nontrivial techniques of semigroup theory: stamps, derived categories and wreath products.
منابع مشابه
One quantifier alternation in first-order logic with modular predicates
Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison x < y and predicates for x ≡ i mod n has been investigated by Barrington, Compton, Straubing and Thérien. The study of FO[<,MOD]fragments was initiated by Chaubard, Pin and Straubing. More recently, Dartois and Paperman showed that definability in the two...
متن کاملLocality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates
We consider first-order formulas over relational structures which may use arbitrary numerical predicates. We require that the validity of the formula is independent of the particular interpretation of the numerical predicates and refer to such formulas as Arb-invariant first-order. Our main result shows a Gaifman locality theorem: two tuples of a structure with n elements, having the same neigh...
متن کاملFirst-Order Encodings for Modular Nonmonotonic Datalog Programs
Recently Modular Nonmonotonic Logic Programs (MLP) have been introduced which incorporate a call-by-value mechanism and allow for unrestricted calls between modules, including mutual and self recursion, as an approach to provide module constructs akin to those in conventional programming in Nonmonotonic Logic Programming under Answer Set Semantics. This paper considers MLPs in a Datalog setting...
متن کاملHILOG: A Foundation for Higher-Order Logic Programming
D We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higher-order syntax and allows arbitrary terms to appear in places where predicates, functions, and atomic formulas occur in predicate calculus. But its semantics is first-order and admits a sound and complete proof procedure. Applic...
متن کاملOn the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates
In this talk I consider first-order formulas (FO, for short) where, apart from the symbols in the given vocabulary, also predicates for linear order and arithmetic may be used. For example, order-invariant formulas are formulas for which the following is true: If a structure satisfies the formula with one particular linear order of the structure’s universe, then it satisfies the formula with an...
متن کامل