Characterizing Quantifier Extensions of Dependence Logic

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential second-order logic.Comment: 9 page

Vienna Circle and Logical Analysis of Relativity Theory

In this paper we present some of our school's results in the area of building up relativity theory (RT) as a hierarchy of theories in the sense of logic. We use plain first-order logic (FOL) as in the foundation of mathematics (FOM) and we build on experience gained in FOM. The main aims of our school are the following: We want to base the theory on simple, unambiguous axioms with clear meanings. It should be absolutely understandable for any reader what the axioms say and the reader can decide about each axiom whether he likes it. The theory should be built up from these axioms in a straightforward, logical manner. We want to provide an analysis of the logical structure of the theory. We investigate which axioms are needed for which predictions of RT. We want to make RT more transparent logically, easier to understand, easier to change, modular, and easier to teach. We want to obtain deeper understanding of RT. Our work can be considered as a case-study showing that the Vienna Circle's (VC) approach to doing science is workable and fruitful when performed with using the insights and tools of mathematical logic acquired since its formation years at the very time of the VC activity. We think that logical positivism was based on the insight and anticipation of what mathematical logic is capable when elaborated to some depth. Logical positivism, in great part represented by VC, influenced and took part in the birth of modern mathematical logic. The members of VC were brave forerunners and pioneers.Comment: 25 pages, 1 firgure

The prospects for mathematical logic in the twenty-first century

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.Comment: Association for Symbolic Logi

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 \equiv i \mod n$ has been investigated by Barrington, Compton, Straubing and Therien. The study of FO[<,MOD]-fragments was initiated by Chaubard, Pin and Straubing. More recently, Dartois and Paperman showed that definability in the two-variable fragment FO2[<,MOD] is decidable. In this paper we continue this line of work. We give an effective algebraic characterization of the word languages in Sigma2[<,MOD]. The fragment Sigma2 consists of first-order formulas in prenex normal form with two blocks of quantifiers starting with an existential block. In addition we show that Delta2[<,MOD], the largest subclass of Sigma2[<,MOD] which is closed under negation, has the same expressive power as two-variable logic FO2[<,MOD]. This generalizes the result FO2[<] = Delta2[<] of Therien and Wilke to modular predicates. As a byproduct, we obtain another decidable characterization of FO2[<,MOD]