•  2
    In order to give a compositional semantics for IF -languages, we shall describe their syntax in a different way. We shall not any longer have quantifiers of the form (∃y/{Q1x1, ..., Qkxk}), (∀y/{Q1x1, ..., Qkxk}), (Qi ∈ {∃, ∀}) but instead (∃xn/{xi1, ..., xim}), (∀xn/{xi1, ..., xim}).
  •  33
    Read on the Liar
    Discusiones Filosóficas 12 (19). 2011.
  •  27
    Logic and linguistics in the twentieth century
    with Alessandro Lenci
    In Leila Haaparanta (ed.), The development of modern logic, Oxford University Press. 2011.
    This chapter begins with a discussion of the three phases of the interaction between logic and linguistics on the nature of universal grammar. It then attempts to reconstruct the dynamics and interactions between these approaches in logic and in linguistic theory, which represent the major landmarks in the quest for the individuation of the universal structure of language.
  •  20
    Partiality and games: propositional logic
    Logic Journal of the IGPL 9 (1): 101-121. 2001.
    We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed transjunction to complete models which, together with the usual Boolean connectives is shown to be functionally complete for all partial functions. Transjunction is seen to be motivated from a game-theoretic perspective, emerging from a two-stage extensive form semantic game of imperfect information between two…Read more
  • Game-Theoretic Semantics
    with Jk Gts Hintikka
    In Benthem & Meulen (eds.), Handbook of Logic and Language, Mit Press. 1997.
    The paper presents an application of game-theoretical ideas to the semantics of natural language, especially the analysis of quantifiers and anaphora. The paper also introduces the idea of games of imperfect information and connects to partial logics.
  •  57
    Jaakko Hintikka in memoriam
    Theoria 81 (4): 289-292. 2015.
  •  17
    numbers as in the following example ♦1,1♦1,2 2,3 5,4p We denote the set of formulas of this modal language by M L(k). For each modality type i, there will be an accessibility relation Ri. That is, an k-ary modal structure for the modal propositional language L will have the form..
  •  13
    The logic of informational independence and finite models
    Logic Journal of the IGPL 5 (1): 79-95. 1997.
    In this paper we relax the assumption that the logical constants of ordinary first-order logic be linearly ordered. As a consequence, we shall have formulas involving not only partially ordered quantifiers, but also partially ordered connectives. The resulting language, called the language of informational independence will be given an interpretation in terms of games of imperfect information. The II-logic will be seen to have some interesting properties: It is very natural to define in this log…Read more
  •  18
    Entre logique et langage
    with François Rivenc
    Vrin. 2009.
    Linguistique et philosophie logique du langage: deux traditions de pensee que bien des choses opposent. La premiere est plutot mentaliste, et orientee vers l'etude de la syntaxe; la seconde, plus preoccupee de semantique, cherche volontiers le sens dans les conditions de verite des phrases. Ce portrait n'est pas faux, mais il est incomplet: entre logique et linguistique, les relations n'ont pas ete, ne sont pas que d'opposition. Dans cet ouvrage, les auteurs proposent une sorte d'histoire concep…Read more
  • Review (review)
    Theoria 75 (1): 52-64. 2009.
  •  85
    Henkin quantifiers and the definability of truth
    with Tapani Hyttinen
    Journal of Philosophical Logic 29 (5): 507-527. 2000.
    Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension $L_{*}^{1}$ (H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close $L_{*}^{1}$ (H) with respect to Boolean operations, and obtain the language L¹(H). At the next level, we consider an extension $L_{*}^{2}$ (H) of L¹(H) in whic…Read more
  •  14
    On Social Rights
    with Martti Kuokkanen
    Ratio Juris 3 (1): 89-94. 1990.
  •  166
    The fallacies of the new theory of reference
    with Jaakko Hintikka
    Synthese 104 (2). 1995.
    The so-called New Theory of Reference (Marcus, Kripke etc.) is inspired by the insight that in modal and intensional contexts quantifiers presuppose nondescriptive unanalyzable identity criteria which do not reduce to any descriptive conditions. From this valid insight the New Theorists fallaciously move to the idea that free singular terms can exhibit a built-in direct reference and that there is even a special class of singular terms (proper names) necessarily exhibiting direct reference. This…Read more
  •  27
    Signalling in independence-friendly logic
    with F. Barbero
    Logic Journal of the IGPL 22 (4): 638-664. 2014.
  •  11
    There is a line of argument which aims to show that certain ontological claims are harmless by making use of conservativity results. The argument goes back to Hilbert who set its general frame. Hilbert’s concern was with certain abstract (ideal) entities in mathematics but the argument has been applied without discrimination to avoid ontological commitment to abstract entities in physics (Field) or to avoid ontological commitment to semantical properties like truth (Shapiro).
  •  117
    Some aspects of negation in English
    Synthese 99 (3). 1994.
    I introduce a formal language called the language of informational independence (IL-language, for short) that extends an ordinary first-order language in a natural way. This language is interpreted in terms of semantical games of imperfect information. In this language, one can define two negations: (i) strong or dual negation, and (ii) weak or contradictory negation. The latter negation, unlike the former, can occur only sentence-initially. Then I argue that, to a certain extent, the two negati…Read more
  • Independence-friendly logic: A game-theoretic approach. LMS Lecture Notes, vol. 386
    with Allen L. Mann and Merlijn Sevenster
    Bulletin of Symbolic Logic 18 (2): 272-273. 2012.
  •  26
    Probabilistic IF Logic
    In Kamal Lodaya (ed.), Logic and its Applications, Springer. pp. 69--79. 2013.
  •  69
    Uses and Misuses of Frege’s Ideas
    with Jaakko Hintikka
    The Monist 77 (3): 278-293. 1994.
    Frege has one magnificent achievement to his credit, viz. the creation of modern formal logic. As a philosopher and as a theoretical logician, he was nevertheless as parochial as he was, geographically speaking. Hence Frege’s concepts and problems offer singularly unfortunate starting points for constructive work in the foundations of logic and mathematics. Even if he is right in some of his views, they depend on severely restrictive assumptions that have to be noted and eliminated. These restri…Read more
  •  15
    Partially ordered connectives and finite graphs
    with Lauri Hella
    In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation, Kluwer Academic Publishers. pp. 79--88. 1995.
  •  70
    Logic and semantics in the twentieth century
    with Tuomo Aho
    In Leila Haaparanta (ed.), The development of modern logic, Oxford University Press. pp. 562. 2011.
    This chapter explores logical semantics, that is, the structural meaning of logical expressions like connectives, quantifiers, and modalities. It focuses on truth-theoretical semantics for formalized languages, a tradition emerging from Carnap's and Tarski's work in the first half of the last century that specifies the meaning of these expressions in terms of the truth-conditions of the sentences in which they occur. It considers Tarski-style definitions of the semantics of a given language in a…Read more
  •  112
    If-logic and truth-definition
    Journal of Philosophical Logic 27 (2): 143-164. 1998.
    In this paper we show that first-order languages extended with partially ordered connectives and partially ordered quantifiers define, under a certain interpretation, their own truth-predicate. The interpretation in question is in terms of games of imperfect information. This result is compared with those of Kripke and Feferman
  •  36
    Equilibrium semantics of languages of imperfect information
    with Merlijn Sevenster
    Annals of Pure and Applied Logic 161 (5): 618-631. 2010.
    In this paper, we introduce a new approach to independent quantifiers, as originally introduced in Informational independence as a semantic phenomenon by Hintikka and Sandu [9] under the header of independence-friendly languages. Unlike other approaches, which rely heavily on compositional methods, we shall analyze independent quantifiers via equilibriums in strategic games. In this approach, coined equilibrium semantics, the value of an IF sentence on a particular structure is determined by the…Read more
  •  100
    Aspects of compositionality
    with Jaakko Hintikka
    Journal of Logic, Language and Information 10 (1): 49-61. 2001.
    We introduce several senses of the principle ofcompositionality. We illustrate the difference between them with thehelp of some recent results obtained by Cameron and Hodges oncompositional semantics for languages of imperfect information.
  •  13
    Ramsey and the notion of arbitrary function
    In Maria J. Frapolli Sanz (ed.), F. P. Ramsey. Critical Reassessments, Continuum International Publishing Group. pp. 237-256. 2005.
    In his article The Foundations of Mathematics (1925) Ramsey was concerned with the nature of the statements of 'pure mathematics' and the way these statements differ from those in empirical sciences. He thought that the answer given to these questions by Hilbert and the formalist school according to which mathematical statements are meaningless formulas, is unsatisfactory for several reasons, which will not be discussed here. He also expressed serious doubts about the intuitionist program develop…Read more
  •  27
    Truth and definite truth
    with Tapani Hyttinen
    Annals of Pure and Applied Logic 126 (1-3): 49-55. 2004.
    In this paper we consider truth as a vague predicate and inquire into the relation between truth and definite truth. We use some tools from modal logic to clarify this distinction, as done in McGee . Finally, we consider the question whether some of the results given by McGee can be transferred to the case in which the underlying logic is stronger than first-order logic. The result will be seen to be negative
  •  62
    On the logic of informational independence and its applications
    Journal of Philosophical Logic 22 (1). 1993.
    We shall introduce in this paper a language whose formulas will be interpreted by games of imperfect information. Such games will be defined in the same way as the games for first-order formulas except that the players do not have complete information of the earlier course of the game. Some simple logical properties of these games will be stated together with the relation of such games of imperfect information to higher-order logic. Finally, a set of applications will be outlined
  •  32
    Tarski’s Guilty Secret: Compositionality
    with Jaakko Hintikka
    Vienna Circle Institute Yearbook 6 217-230. 1999.
    Tarski has exerted enormous influence not only on the development of mathematical logic, but on twentieth-century philosophy and philosophical analysis. This influence has been twofold, with the two components pulling in a sense in opposite directions. A comparison with the influence of the Vienna Circle provides an instructive vantage point in viewing Tarski’s influence. On the one hand, Tarski has provided powerful tools for logical analysis in philosophy. His first and most important contribu…Read more