A complete first-order logic with infinitary predicates
نویسندگان
چکیده
منابع مشابه
Restricted truth predicates in first-order logic
It is well-known that there exist consistent first-order theories that become inconsistent when we add Tarski’s schema T. This is Tarski’s Theorem. To avoid the inconsistency result, one can restrict Tarski’s schema in different ways. In our paper we restrict Tarski’s schema T by only instantiating the schema with a proper subset of the set of all sentences. We prove several results concerning ...
متن کامل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...
متن کامل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...
متن کاملFirst-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-order logic (MSO): in FO(R) one can demand that a node is reachably from another by some sequence of edges, whereas in FO(Reg) a regular set of allowed edge sequences can be given additionally. We study FO(Reg) logic in...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1963
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-52-2-177-203