-
152Aesthetics and the Dream of Objectivity: Notes from Set TheoryInquiry: An Interdisciplinary Journal of Philosophy 58 (1): 83-98. 2015.In this paper, we consider various ways in which aesthetic value bears on, if not serves as evidence for, the truth of independent statements in set theory.... the aesthetic issue, which in practice will also for me be the decisive factor—John von Neumann, letter to Carnap, 1931For me, it is the aesthetics which may very well be the final arbiter—P. J. Cohen, 2002
-
46This book comprises revised full versions of lectures given during the 9th European Summer School in Logic, Languages, and Information, ESSLLI'97, held in Aix-en-Provence, France, in August 1997. The six lectures presented introduce the reader to the state of the art in the area of generalized quantifiers and computation. Besides an introductory survey by the volume editor various aspects of generalized quantifiers are studied in depth.
-
341The hierarchy theorem for generalized quantifiersJournal of Symbolic Logic 61 (3): 802-817. 1996.The concept of a generalized quantifier of a given similarity type was defined in [12]. Our main result says that on finite structures different similarity types give rise to different classes of generalized quantifiers. More exactly, for every similarity type t there is a generalized quantifier of type t which is not definable in the extension of first order logic by all generalized quantifiers of type smaller than t. This was proved for unary similarity types by Per Lindström [17] with a count…Read more
-
On the Number of Automorphisms of Uncountable ModelsJournal of Symbolic Logic 59 (4): 1402-1418. 1994.Let $\sigma$ denote the number of automorphisms of a model $\mathfrak{U}$ of power $\omega_1$. We derive a necessary and sufficient condition in terms of trees for the existence of an $\mathfrak{U}$ with $\omega_1 < \sigma < 2^{\omega_1}$. We study the sufficiency of some conditions for $\sigma = 2^{\omega_1}$. These conditions are analogous to conditions studied by D. Kueker in connection with countable models.
-
104On the Symbiosis Between Model-Theoretic and Set-Theoretic Properties of Large CardinalsJournal of Symbolic Logic 81 (2): 584-604. 2016.We study some large cardinals in terms of reflection, establishing new connections between the model-theoretic and the set-theoretic approaches.
-
105On the semantics of informational independenceLogic Journal of the IGPL 10 (3): 339-352. 2002.The semantics of the independence friendly logic of Hintikka and Sandu is usually defined via a game of imperfect information. We give a definition in terms of a game of perfect information. We also give an Ehrenfeucht-Fraïssé game adequate for this logic and use it to define a Distributive Normal Form for independence friendly logic
-
75Games and trees in infinitary logic: A surveyIn Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions, Kluwer Academic Publishers. pp. 105--138. 1995.
-
170Axiomatizing first-order consequences in dependence logicAnnals of Pure and Applied Logic 164 (11): 1101-1117. 2013.Dependence logic, introduced in Väänänen [11], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem
-
266Abstract logic and set theory. II. large cardinalsJournal of Symbolic Logic 47 (2): 335-346. 1982.The following problem is studied: How large and how small can the Löwenheim and Hanf numbers of unbounded logics be in relation to the most common large cardinals? The main result is that the Löwenheim number of the logic with the Härtig-quantifier can be consistently put in between any two of the first weakly inaccessible, the first weakly Mahlo, the first weakly compact, the first Ramsey, the first measurable and the first supercompact cardinals
-
90Quantum Team Logic and Bell’s InequalitiesReview of Symbolic Logic 8 (4): 722-742. 2015.A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4]. Since it is now considered empirically established that quantum mechanics violates Bell's Inequalities, we introduce a modified probability logic, that we call quantum team logic, in which Bell's Inequalities are not provable, and prove a Completeness Theorem …Read more
-
226Stationary sets and infinitary logicJournal of Symbolic Logic 65 (3): 1311-1320. 2000.Let K 0 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ is disjoint from a club, and let K 1 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{ is regular, then no sentence of L λ+κ separates K 0 λ and K 1 λ . On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{ , and a forcing axiom holds (and ℵ L 1 = ℵ 1 if μ = ℵ 0 ), then there is a sentence of L λλ which separates K 0 λ and…Read more
-
313Dependence and IndependenceStudia Logica 101 (2): 399-410. 2013.We introduce an atomic formula ${\vec{y} \bot_{\vec{x}}\vec{z}}$ intuitively saying that the variables ${\vec{y}}$ are independent from the variables ${\vec{z}}$ if the variables ${\vec{x}}$ are kept constant. We contrast this with dependence logic ${\mathcal{D}}$ based on the atomic formula = ${(\vec{x}, \vec{y})}$ , actually equivalent to ${\vec{y} \bot_{\vec{x}}\vec{y}}$ , saying that the variables ${\vec{y}}$ are totally determined by the variables ${\vec{x}}$ . We show that ${\vec{y} \bot_{…Read more
-
150Finite information logicAnnals of Pure and Applied Logic 134 (1): 83-93. 2005.We introduce a generalization of Independence Friendly logic in which Eloise is restricted to a finite amount of information about Abelard’s moves. This logic is shown to be equivalent to a sublogic of first-order logic, to have the finite model property, and to be decidable. Moreover, it gives an exponential compression relative to logic
-
209The Craig Interpolation Theorem in abstract model theorySynthese 164 (3): 401-420. 2008.The Craig Interpolation Theorem is intimately connected with the emergence of abstract logic and continues to be the driving force of the field. I will argue in this paper that the interpolation property is an important litmus test in abstract model theory for identifying “natural,” robust extensions of first order logic. My argument is supported by the observation that logics which satisfy the interpolation property usually also satisfy a Lindström type maximality theorem. Admittedly, the range…Read more
-
2415A taste of set theory for philosophersJournal of the Indian Council of Philosophical Research (2): 143-163. 2011.
-
127Dependence of variables construed as an atomic formulaAnnals of Pure and Applied Logic 161 (6): 817-828. 2010.We define a logic capable of expressing dependence of a variable on designated variables only. Thus has similar goals to the Henkin quantifiers of [4] and the independence friendly logic of [6] that it much resembles. The logic achieves these goals by realizing the desired dependence declarations of variables on the level of atomic formulas. By [3] and [17], ability to limit dependence relations between variables leads to existential second order expressive power. Our avoids some difficulties ar…Read more
-
On Applications of Transfer Principles in Model TheoryIn Alessandro Andretta (ed.), On Applications of Transfer Principles in Model Theory, Quaderni Di Matematica. 2007.
-
437Second-order logic and foundations of mathematicsBulletin of Symbolic Logic 7 (4): 504-520. 2001.We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically. First-order se…Read more
-
243The härtig quantifier: A surveyJournal of Symbolic Logic 56 (4): 1153-1183. 1991.A fundamental notion in a large part of mathematics is the notion of equicardinality. The language with Hartig quantifier is, roughly speaking, a first-order language in which the notion of equicardinality is expressible. Thus this language, denoted by LI, is in some sense very natural and has in consequence special interest. Properties of LI are studied in many papers. In [BF, Chapter VI] there is a short survey of some known results about LI. We feel that a more extensive exposition of these r…Read more
-
285On the number of automorphisms of uncountable modelsJournal of Symbolic Logic 58 (4): 1402-1418. 1993.Let σ(U) denote the number of automorphisms of a model U of power ω1. We derive a necessary and sufficient condition in terms of trees for the existence of an U with $\omega_1 < \sigma(\mathfrak{U}) < 2^{\omega_1}$. We study the sufficiency of some conditions for σ(U) = 2ω1 . These conditions are analogous to conditions studied by D. Kueker in connection with countable models
-
253Jouko Väänänen, A hierarchy theorem for Lindstrom quantifiers, Logic and abstraction, Essays dedicated to Per Lindström on his fiftieth birthday, edited by Mats Furberg, Thomas Wetterström, and Claes Åberg, Acta philosophica Gothoburgensia, no. 1, Acta Universitatis Gothobargensis, Göteborg1986, pp. 317–323Journal of Symbolic Logic 54 (2): 631-631. 1989.
-
58Pursuing Logic without BordersIn Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics, De Gruyter. pp. 403-416. 2015.
-
98A Remark on Negation in Dependence LogicNotre Dame Journal of Formal Logic 52 (1): 55-65. 2011.We show that for any pair $\phi$ and $\psi$ of contradictory formulas of dependence logic there is a formula $\theta$ of the same logic such that $\phi\equiv\theta$ and $\psi\equiv\neg\theta$. This generalizes a result of Burgess
Helsinki, Southern Finland, Finland