Fragments of First-Order Logic over Infinite Words
نویسندگان
چکیده
منابع مشابه
Fragments of First - Order Logic over Infinite
We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for ω-languages: Σ2, ∆2, FO 2 ∩ Σ2 (and by duality FO 2 ∩ Π2), and FO . These descriptions extend the respective results for finite words. In particular, we relate the above fragments to language classes of certain (unambiguous) polynomials. An im...
متن کاملFirst-order Fragments with Successor over Infinite Words
We consider fragments of first-order logic and as models we allow finite and infinite words simultaneously. The only binary relations apart from equality are order comparison < and the successor predicate +1. We give characterizations of the fragments Σ2 = Σ2[<,+1] and FO2 = FO2[<,+1] in terms of algebraic and topological properties. To this end we introduce the factor topology over infinite wo...
متن کاملA Survey on Small Fragments of First-Order Logic over Finite Words
We consider fragments of first-order logic over finite words. In particular, we deal with first-order logic with a restricted number of variables and with the lower levels of the alternation hierarchy. We use the algebraic approach to show decidability of expressibility within these fragments. As a byproduct, we survey several characterizations of the respective fragments. We give complete proo...
متن کاملFirst-Order Logic with Reachability Predicates over Infinite Systems
The general task in verification is to check whether a given (possibly infinite) system or structure satisfies a given specification. The specification is usually expressed by a logical formula in a fundamental logic like first-order (FO) predicate logic or monadic second-order (MSO) logic. A weakness of FO logic is that reachability properties, which are important in verification, are not defi...
متن کاملTwo-variable first order logic with modular predicates over words
We consider first order formulae over the signature consisting of the symbols of the alphabet, the symbol < (interpreted as a linear order) and the set MOD of modular numerical predicates. We study the expressive power of FO2[<,MOD], the two-variable first order logic over this signature, interpreted over finite words. We give an algebraic characterization of the corresponding regular languages...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2010
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-010-9266-7