55 found
Sort by:
Disambiguations:
Jouko Väänänen [54]Jouko A. Väänänen [1]
See also:
Profile: Jouko Väänänen (University of Helsinki, University of Amsterdam)
  1. Juliette Kennedy & Jouko Vaananen (forthcoming). Aesthetics and the Dream of Objectivity: Notes From Set Theory. Inquiry.
    No categories
     
    My bibliography  
     
    Export citation  
  2. Erich Grädel & Jouko Väänänen (2013). Dependence and Independence. Studia Logica 101 (2):399-410.
    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_{\vec{x}}\vec{z}}$ gives rise to a natural logic capable of formalizing basic intuitions about independence and dependence. (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Juha Kontinen & Jouko Väänänen (2013). Axiomatizing First-Order Consequences in Dependence Logic. Annals of Pure and Applied Logic 164 (11):1101-1117.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. Juha Kontinen, Jouko Väänänen & Dag Westerståhl (2013). Editorial Introduction. Studia Logica 101 (2):233-236.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Jouko Väänänen & Tong Wang (2013). An Ehrenfeucht‐Fraïssé Game for Lω1ω. Mathematical Logic Quarterly 59 (4-5):357-370.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Jouko Väänänen (2012). Second Order Logic or Set Theory? Bulletin of Symbolic Logic 18 (1):91-121.
    We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be in manifest conflict with each (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  7. Mirna Džamonja & Jouko Väänänen (2011). Chain Models, Trees of Singular Cardinality and Dynamic Ef-Games. Journal of Mathematical Logic 11 (01):61-85.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Menachem Magidor & Jouko Väänänen (2011). On Löwenheim–Skolem–Tarski Numbers for Extensions of First Order Logic. Journal of Mathematical Logic 11 (01):87-113.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Jouko Väänänen (2011). A Taste of Set Theory for Philosophers. Journal of the Indian Council of Philosophical Research (2):143-163.
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. Jouko Väänänen (2011). Erratum To: On Definability in Dependence Logic. [REVIEW] Journal of Logic, Language and Information 20 (1):133-134.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. Juha Kontinen & Jouko Väänänen (2010). A Remark on Negation in Dependence Logic. Notre Dame Journal of Formal Logic 52 (1):55-65.
    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.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  12. Jouko Väänänen & Wilfrid Hodges (2010). Dependence of Variables Construed as an Atomic Formula. Annals of Pure and Applied Logic 161 (6):817-828.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Jouko Väänänen & Dag Westerståhl (2010). In memoriam: Per Lindström. Theoria 76 (2):100-107.
    Translate to English
    | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  14. Dag Westerståhl & Jouko Väänänen (2010). Per Lindström: In Memoriam. Theoria 76 (2):100-107.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  15. Samson Abramsky & Jouko Väänänen (2009). From If to Bi. Synthese 167 (2):207 - 230.
    We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Barbara F. Csima, Inessa Epstein, Rahim Moosa, Christian Rosendal, Jouko Väänänen & Ali Enayat (2009). Marriott Wardman Park Hotel, Washington, DC January 7–8, 2009. Bulletin of Symbolic Logic 15 (2).
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. Juha Kontinen & Jouko Väänänen (2009). On Definability in Dependence Logic. Journal of Logic, Language and Information 18 (3):317-332.
    We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. S. Barry Cooper, Herman Geuvers, Anand Pillay & Jouko Väänänen (2008). Preface. Annals of Pure and Applied Logic 156 (1):1-2.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Juliette Kennedy, Saharon Shelah & Jouko Väänänen (2008). Regular Ultrafilters and Finite Square Principles. Journal of Symbolic Logic 73 (3):817-823.
    We show that many singular cardinals λ above a strongly compact cardinal have regular ultrafilters D that violate the finite square principle $\square _{\lambda ,D}^{\mathit{fin}}$ introduced in [3]. For such ultrafilters D and cardinals λ there are models of size λ for which Mλ / D is not λ⁺⁺-universal and elementarily equivalent models M and N of size λ for which Mλ / D and Nλ / D are non-isomorphic. The question of the existence of such ultrafilters and models was (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  20. Jouko Väänänen (2008). The Craig Interpolation Theorem in Abstract Model Theory. Synthese 164 (3):401 - 420.
    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 of such logics is small.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  21. Juliette Kennedy & Jouko Vaananen (2007). On Applications of Transfer Principles in Model Theory. In Alessandro Andretta (ed.), On Applications of Transfer Principles in Model Theory. Quaderni di Matematica.
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  22. Saharon Shelah & Jouko Väänänen (2006). Recursive Logic Frames. Mathematical Logic Quarterly 52 (2):151-164.
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  23. Jouko Väänänen (2006). A Remark on Nondeterminacy in IF Logic. Acta Philosophica Fennica 78 (2006):71-77.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  24. Rohit Parikh & Jouko Väänänen (2005). Finite Information Logic. Annals of Pure and Applied Logic 134 (1):83-93.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. Saharon Shelah & Jouko Väänänen (2005). A Note on Extensions of Infinitary Logic. Archive for Mathematical Logic 44 (1):63-69.
    We show that a strong form of the so called Lindström’s Theorem [4] fails to generalize to extensions of L κ ω and L κ κ : For weakly compact κ there is no strongest extension of L κ ω with the (κ,κ)-compactness property and the Löwenheim-Skolem theorem down to κ. With an additional set-theoretic assumption, there is no strongest extension of L κ κ with the (κ,κ)-compactness property and the Löwenheim-Skolem theorem down to <κ.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Jouko Vaananen (2004). Barwise: Abstract Model Theory and Generalized Quantifiers. Bulletin of Symbolic Logic 10 (1):37-53.
  27. Jouko Väänänen (2004). Barwise: Abstract Model Theory and Generalized Quantifiers. Bulletin of Symbolic Logic 10 (1):37-53.
  28. Jouko Väänänen & Boban Veličković (2004). Games Played on Partial Isomorphisms. Archive for Mathematical Logic 43 (1):19-30.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  29. France Xii, Marcelo Coniglio, Gilles Dowek, Jouko Väänanen, Renata Wassermann, Eric Allender, Jean-Baptiste Joinet & Dale Miller (2004). Ouro Preto (Minas Gerais), Brazil July 29–August 1, 2003. Bulletin of Symbolic Logic 10 (2).
    Direct download  
     
    My bibliography  
     
    Export citation  
  30. Jouko Väänänen & Dag Westerståhl (2002). On the Expressive Power of Monotone Natural Language Quantifiers Over Finite Models. Journal of Philosophical Logic 31 (4):327-358.
    We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties - here called CE quantifiers - one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  31. Jouko Vaananen (2001). Second-Order Logic and Foundations of Mathematics. Bulletin of Symbolic Logic 7 (4):504-520.
    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 set theory and second-order logic are not radically (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  32. Saharon Shelah & Jouko Väänänen (2000). Stationary Sets and Infinitary Logic. Journal of Symbolic Logic 65 (3):1311-1320.
    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 (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  33. Jörg Flum, Matthias Schiehlen & Jouko Väänänen (1999). Quantifiers and Congruence Closure. Studia Logica 62 (3):315-340.
    We prove some results about the limitations of the expressive power of quantifiers on finite structures. We define the concept of a bounded quantifier and prove that every relativizing quantifier which is bounded is already first-order definable (Theorem 3.8). We weaken the concept of congruence closed (see [6]) to weakly congruence closed by restricting to congruence relations where all classes have the same size. Adapting the concept of a thin quantifier (Caicedo [1]) to the framework of finite structures, we define (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  34. Stevo Todorčević & Jouko Väänänen (1999). Trees and Ehrenfeucht–Fraı̈ssé Games. Annals of Pure and Applied Logic 100 (1-3):69-97.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Lauri Hella, Jouko Väänänen & Dag Westerståhl (1997). Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6 (3):305-335.
    We study generalized quantifiers on finite structures.With every function : we associate a quantifier Q by letting Q x say there are at least (n) elementsx satisfying , where n is the sizeof the universe. This is the general form ofwhat is known as a monotone quantifier of type .We study so called polyadic liftsof such quantifiers. The particular lifts we considerare Ramseyfication, branching and resumption.In each case we get exact criteria fordefinability of the lift in terms of simpler quantifiers.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  36. Jouko Vaananen (1997). Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language, and Information, ESSLLI'97 Workshop, Aix-En-Provence, France, August 11-22, 1997, Revised Lectures. Springer.
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  37. Jouko Väänänen (1997). Unary Quantifiers on Finite Models. Journal of Logic, Language and Information 6 (3):275-304.
    In this paper (except in Section 5) all quantifiers are assumedto be so called simple unaryquantifiers, and all models are assumedto be finite. We give a necessary and sufficientcondition for a quantifier to be definablein terms of monotone quantifiers. For amonotone quantifier we give a necessaryand sufficient condition for beingdefinable in terms of a given set of bounded monotonequantifiers. Finally, we give a necessaryand sufficient condition for a monotonequantifier to be definable in terms of agiven monotone quantifier.Our analysis shows that (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  38. Lauri Hella, Kerkko Luosto & Jouko Väänänen (1996). The Hierarchy Theorem for Generalized Quantifiers. Journal of Symbolic Logic 61 (3):802-817.
    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 (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  39. Phokion G. Kolaitis & Jouko A. Väänänen (1995). Generalized Quantifiers and Pebble Games on Finite Structures. Annals of Pure and Applied Logic 74 (1):23-75.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. Jouko Väänänen (1995). Games and Trees in Infinitary Logic: A Survey. In. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. 105--138.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Heikki Heikkilä & Jouko Väänänen (1994). Reflection of Long Game Formulas. Mathematical Logic Quarterly 40 (3):381-392.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  42. Alan Mekler & Jouko Väänänen (1993). Trees and Π 1 1 -Subsets of Ω1 Ω 1. Journal of Symbolic Logic 58 (3):1052 - 1070.
    We study descriptive set theory in the space ω1 ω 1 by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of Π 1 1 -sets of ω1 ω 1 . We call a family U of trees universal for a class V of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in V can be order-preservingly mapped (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Alan Mekler & Jouko Vaananen (1993). Trees and $Pi^11$-Subsets of $^{Omega_1}Omega1$. Journal of Symbolic Logic 58 (3):1052-1070.
    We study descriptive set theory in the space $^{\omega_1}\omega_1$ by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of $\Pi^1_1$-sets of $^{\omega_1}\omega_1$. We call a family $\mathscr{U}$ of trees universal for a class $\mathscr{V}$ of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in $\mathscr{V}$ can be order-preservingly mapped into a tree in $\mathscr{U}$. It is well (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  44. Alan Mekler & Jouko Vaananen (1993). Trees and Π11-Subsets of Ω1ω. Journal of Symbolic Logic 58 (3).
    Direct download  
     
    My bibliography  
     
    Export citation  
  45. Juha Oikkonen & Jouko Väänänen (1993). Game-Theoretic Inductive Definability. Annals of Pure and Applied Logic 65 (3):265-306.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  46. Saharon Shelah, Heikki Tuuri & Jouko Väänänen (1993). On the Number of Automorphisms of Uncountable Models. Journal of Symbolic Logic 58 (4):1402-1418.
    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.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  47. Gabriel Sandu & Jouko Väänänen (1992). Partially Ordered Connectives. Mathematical Logic Quarterly 38 (1):361-372.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  48. Heinrich Herre, Michał Krynicki, Alexandr Pinus & Jouko Väänänen (1991). The Härtig Quantifier: A Survey. Journal of Symbolic Logic 56 (4):1153-1183.
    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 (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  49. Tapani Hyttinen & Jouko Väänänen (1990). On Scott and Karp Trees of Uncountable Models. Journal of Symbolic Logic 55 (3):897-908.
    Let U and B be two countable relational models of the same first order language. If the models are nonisomorphic, there is a unique countable ordinal α with the property that $\mathfrak{U} \equiv^\alpha_{\infty\omega} \mathfrak{B} \text{but not} \mathfrak{U} \equiv^{\alpha + 1}_{\infty\omega} \mathfrak{B},$ i.e. U and B are L ∞ω -equivalent up to quantifier-rank α but not up to α + 1. In this paper we consider models U and B of cardinality ω 1 and construct trees which have a similar relation (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  50. Michael Krynicki & Jouko Väänänen (1989). Henkin and Function Quantifiers. Annals of Pure and Applied Logic 43 (3):273-292.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 55