Gabriel Sandu

We consider two versions of truth as grounded in verification procedures: Dummett's notion of proof as an effective way to establish the truth of a statement and Hintikka's GTS notion of truth as given by the existence of a winning strategy for the game associated with a statement. Hintikka has argued that the two notions should be effective and that one should thus restrict one's attention to recursive winning strategies. In the context of arithmetic, we show that the two notions do not coincide: on the one hand, proofs in PA do not yield recursive winning strategies for the associated game; on the other hand, there is no sound and effective proof procedure that captures recursive GTS truths. We then consider a generalized version of Game Theoretical Semantics by introducing games with backward moves. In this setting, a connection is made between proofs and recursive winning strategies. We then apply this distinction between two kinds of verificationist procedures to a recent debate about how we recognize the truth of Gödelian sentences.

The paper argues that there are two main kinds of joint action, direct joint bringing about (or performing) something (expressed in terms of a DO-operator) and jointly seeing to it that something is the case (expressed in terms of a Stit-operator). The former kind of joint action contains conjunctive, disjunctive and sequential action and its central subkinds. While joint seeing to it that something is the case is argued to be necessarily intentional, direct joint performance can also be nonintentional. Actions performed by social groups are analyzed in terms of the notions of joint action (basically DO and Stit).A precise semantical analysis of the aforementioned kinds of joint action is given in terms of time-trees. With each participant a tree is connected, and the trees are joined defining joint possible worlds in terms of state-expressing nodes from the trees. Sentences containing DO and Stit are semantically evaluated with respect to such joint possible worlds. Intentional joint actions are characterized in terms of the notion of we-intention (joint intention), characterized formally by means of a special operator.

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 logic two negations, weak negation as failure to verify a sentence, and strong negation as the existence of a falsifying strategy: One can express in this logic complete problems of finite structures, like the non-connectedness and 3-colorability of finite graphs, the satisfiability problem for Boolean circuits built up from NAND-gates, etc

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like 'All the theorems are true', 'Everything Peter said is true', etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first-order logic, full second-order logic, and existential second-order (?11-) logic.

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 negations match the distinction existing in natural languages between sentential and constituent negation. As a corollary, I derive the fact that there are no mechanical rules for forming the contradictory negation of an English sentence.

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 players. This game-theoretic approach yields an interpretation where partiality is generated as a property of non-determinacy of games. Over-defined values are produced by adding a weak, contradictory negation or, alternatively, by relaxing the assumption that games are strictly competitive. In general, particular forms of extensive imperfect information games give rise to a generalised propositional logic where various forms of informational dependencies and independencies of connectives can be studied

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 conceptuelle des interactions fecondes entre les deux disciplines au cours du XXe siecle. La premiere partie, consacree a la notion de categorie semantique et/ou syntaxique, raconte comment les theories a priori de la signification (Husserl, Frege, Russell) ont progressivement donne lieu au programme des grammaires categorielles, d'inspiration plus descriptive et empirique. La deuxieme partie traite d'un autre episode, datant des annees cinquante a soixante-dix, et lie a la naissance des grammaires generatives: celui au cours duquel l'opposition entre la these avancee par Chomsky de l'autonomie de la syntaxe, et l'idee de la priorite conceptuelle de la semantique, soutenue par des logiciens comme Montague, vient au premier plan. Enfin la troisieme partie traite des recherches tout a fait contemporaines concernant l'etude des expressions indefinies et des relations anaphoriques qu'elles soutiennent, theme ou se dessinent des convergences nouvelles entre l'analyse logique et l'analyse linguistique: la comprehension des rapports entre generalite et reference dans les langages naturels y gagnera certainement en finesse et en adequation empirique.

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 expected utility of the existential player in any of the game’s equilibriums. This approach was suggested in Henkin quantifiers and complete problems by Blass and Gurevich [2] but has not been taken up before. We prove that each rational number can be realized by an IF sentence. We also give a lower and upper bound on the expressive power of IF logic under equilibrium semantics

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 which every sentence is an L¹(H)-sentence prefixed with a Henkin quantifier. We repeat this construction to infinity. Using the (un)definability of truth - in - N for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996)

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 developed by Brouwer and Weyl. It is the logicist school of Frege, Russell and Whitehead, which attempted to reduce mathematics to few logical concepts, that came closest to Ramsey’s views, although he was not completely satisfied with it, either.