Gabriel Sandu

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

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

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 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.

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)

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 restrictive assumptions have not been sufficiently acknowledged in most of the recent discussions of Frege’s ideas. This has given rise to wild overstatements of Frege’s achievements. To give only two examples, Frege is sometimes said to have had within his reach “the concepts necessary to frame the notion of the completeness of a formalization of logic as well as soundness.” Or, he is credited with the creation of mathematical logic “issuing in a formal system logic incorporating propositional calculus, first- and second-order quantification theory, and a theory of sets developed within second-order quantification theory.” We will soon see that both these claims are not only severely exaggerated but that they miss some of the most characteristic features of Frege’s entire way of thinking about logical and semantical matters.

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 stronger metalanguage, Tarski's impossibility results, and attempts to overcome them in the post-Tarskian tradition.