Switch to: Citations

References in:

Independence friendly logic

Stanford Encyclopedia of Philosophy (2010)

Add references

You must login to add references.
  1. Classical Negation and Game-Theoretical Semantics.Tero Tulenheimo - 2014 - Notre Dame Journal of Formal Logic 55 (4):469-498.
    Typical applications of Hintikka’s game-theoretical semantics give rise to semantic attributes—truth, falsity—expressible in the $\Sigma^{1}_{1}$-fragment of second-order logic. Actually a much more general notion of semantic attribute is motivated by strategic considerations. When identifying such a generalization, the notion of classical negation plays a crucial role. We study two languages, $L_{1}$ and $L_{2}$, in both of which two negation signs are available: $\rightharpoondown $ and $\sim$. The latter is the usual GTS negation which transposes the players’ roles, while the former (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Why Play Logical Games?Mathieu Marion - 2009 - In Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.), Games: Unifying Logic, Language, and Philosophy. Dordrecht, Netherland: Springer Verlag. pp. 3--26.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Henkin Quantifiers and Complete Problems.Andreas Blass & Yuri Gurevich - 1986 - Annals of Pure and Applied Logic 32:1--16.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Equilibrium semantics of languages of imperfect information.Merlijn Sevenster & Gabriel Sandu - 2010 - Annals of Pure and Applied Logic 161 (5):618-631.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Quantifiers vs. Quantification Theory.Jaakko Hintikka - 1973 - Dialectica 27 (3‐4):329-358.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • Compositional Natural Language Semantics using Independence Friendly Logic or Dependence Logic.Theo M. V. Janssen - 2013 - Studia Logica 101 (2):453-466.
    Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics. In this contribution we will compare these two logics by investigating their application in a compositional analysis of the de (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
    Download  
     
    Export citation  
     
    Bookmark   102 citations  
  • Quantifiers in Language and Logic.Stanley Peters & Dag Westerståhl - 2006 - Oxford, England: Clarendon Press.
    Quantification is a topic which brings together linguistics, logic, and philosophy. Quantifiers are the essential tools with which, in language or logic, we refer to quantity of things or amount of stuff. In English they include such expressions as no, some, all, both, many. Peters and Westerstahl present the definitive interdisciplinary exploration of how they work - their syntax, semantics, and inferential role.
    Download  
     
    Export citation  
     
    Bookmark   110 citations  
  • Logic, language-games and information: Kantian themes in the philosophy of logic.Jaakko Hintikka - 1973 - Oxford,: Clarendon Press.
    I LOGIC IN PHILOSOPHY— PHILOSOPHY OF LOGIC i. On the relation of logic to philosophy I n this book, the consequences of certain logical insights for ...
    Download  
     
    Export citation  
     
    Bookmark   129 citations  
  • Some aspects of negation in English.Gabriel Sandu - 1994 - Synthese 99 (3):345 - 360.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the development of the model-theoretic viewpoint in logical theory.Jaakko Hintikka - 1988 - Synthese 77 (1):1 - 36.
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • A revolution in the foundations of mathematics?Jaakko Hintikka - 1997 - Synthese 111 (2):155-170.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • From compositional to systematic semantics.Wlodek Zadrozny - 1994 - Linguistics and Philosophy 17 (4):329 - 342.
    We prove a theorem stating that any semantics can be encoded as a compositional semanties, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is required to be systematic (that is, the meaning function cannot be arbitrary, but must belong to some class), it is possible to distinguish between compositional and noncompositional semantics. As a result, we believe that the paper clarifies the concept of compositionality and opens the possibility of (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • (1 other version)Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • Second-order logic and foundations of mathematics.Jouko Väänänen - 2001 - 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Independent choices and the interpretation of IF logic.Theo M. V. Janssen - 2002 - Journal of Logic, Language and Information 11 (3):367-387.
    In this paper it is argued that Hintikka's game theoreticalsemantics for Independence Friendly logic does not formalize theintuitions about independent choices; it rather is aformalization of imperfect information. Furthermore it is shownthat the logic has several remarkable properties (e.g.,renaming of bound variables is not allowed). An alternativesemantics is proposed which formalizes intuitions aboutindependence.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Henkin quantifiers and the definability of truth.Tapani Hyttinen & Gabriel Sandu - 2000 - Journal of Philosophical Logic 29 (5):507-527.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Truth definitions, Skolem functions and axiomatic set theory.Jaakko Hintikka - 1998 - Bulletin of Symbolic Logic 4 (3):303-337.
    §1. The mission of axiomatic set theory. What is set theory needed for in the foundations of mathematics? Why cannot we transact whatever foundational business we have to transact in terms of our ordinary logic without resorting to set theory? There are many possible answers, but most of them are likely to be variations of the same theme. The core area of ordinary logic is by a fairly common consent the received first-order logic. Why cannot it take care of itself? (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • No scope for scope?Jaakko Hintikka - 1997 - Linguistics and Philosophy 20 (5):515-544.
    The notion of scope as it relates to a model of logical form is discussed. The inability of the accepted definition of scope to account for the contrast between priority scope - the logical priority of different quantifiers & other logical notions via rule ordering - & binding scope - the identification of the connection between variables of quantification & a particular quantifier - is demonstrated. The semantic ambiguity of this dichotomy of scope is explored via examination of donkey sentences. (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Quantum logic as a fragment of independence-friendly logic.Jaakko Hintikka - 2002 - Journal of Philosophical Logic 31 (3):197-209.
    The working assumption of this paper is that noncommuting variables are irreducibly interdependent. The logic of such dependence relations is the author's independence-friendly (IF) logic, extended by adding to it sentence-initial contradictory negation ¬ over and above the dual (strong) negation ∼. Then in a Hilbert space ∼ turns out to express orthocomplementation. This can be extended to any logical space, which makes it possible to define the dimension of a logical space. The received Birkhoff and von Neumann "quantum logic" (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Hyperclassical logic (A.K.A. IF logic) and its implications for logical theory.Jaakko Hintikka - 2002 - Bulletin of Symbolic Logic 8 (3):404-423.
    Let us assume that you are entrusted by UNESCO with an important task. You are asked to devise a universal logical language, a Begriffsschrift in Frege's sense, which is to serve the purposes of science, business and everyday life. What requirements should such a “conceptual notation” satisfy? There are undoubtedly many relevant desiderata, but here I am focusing on one unmistakable one. In order to be a viable lingua universalis, your language must in any case be capable of representing any (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Independence-friendly logic without Henkin quantification.Fausto Barbero, Lauri Hella & Raine Rönnholm - 2021 - Archive for Mathematical Logic 60 (5):547-597.
    We analyze the expressive resources of \ logic that do not stem from Henkin quantification. When one restricts attention to regular \ sentences, this amounts to the study of the fragment of \ logic which is individuated by the game-theoretical property of action recall. We prove that the fragment of prenex AR sentences can express all existential second-order properties. We then show that the same can be achieved in the non-prenex fragment of AR, by using “signalling by disjunction” instead of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Complexity of syntactical tree fragments of Independence-Friendly logic.Fausto Barbero - 2021 - Annals of Pure and Applied Logic 172 (1):102859.
    A dichotomy result of Sevenster (2014) [29] completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain “Henkin” or “signalling” patterns were shown to characterize fragments of IF logic that capture NP-complete problems; all the remaining prefixes were shown instead to be essentially first-order. In the present paper we develop the machinery which is needed in order to extend the results of Sevenster to non-prenex, regular (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Some Theorems About the Sentential Calculi of Lewis and Heyting.J. C. C. Mckinsey & Alfred Tarski - 1948 - Journal of Symbolic Logic 13 (3):171-172.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • (1 other version)Completeness in the Theory of Types.Leon Henkin - 1950 - Journal of Symbolic Logic 16 (1):72-73.
    Download  
     
    Export citation  
     
    Bookmark   87 citations  
  • (2 other versions)On a Generalization of Quantifiers.A. Mostowski - 1958 - Journal of Symbolic Logic 23 (2):217-217.
    Download  
     
    Export citation  
     
    Bookmark   86 citations  
  • Signalling In Languages With Imperfect Information.Gabriel Sandu - 2001 - Synthese 127 (1-2):21-34.
    This paper is a short survey of different languageswith imperfect information introduced in (Hintikka and Sandu 1989).The imperfect information concerns both quantifiers and connectives.At the end, I will sketch a connection between these languages and linearlogic.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • IF logic and the foundations of mathematics.Gabriel Sandu & Tapani Hyttinen - 2001 - Synthese 126 (1-2):37-47.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Partially ordered connectives.Gabriel Sandu & Jouko Väänänen - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):361-372.
    We show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The Game of Language: Studies in Game-Theoretical Semantics and Its Applications.Jaakko Hintikka - 1983 - Springer Verlag.
    Since the first chapter of this book presents an intro duction to the present state of game-theoretical semantics (GTS), there is no point in giving a briefer survey here. Instead, it may be helpful to indicate what this volume attempts to do. The first chapter gives a short intro duction to GTS and a survey of what is has accomplished. Chapter 2 puts the enterprise of GTS into new philo sophical perspective by relating its basic ideas to Kant's phi losophy (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Compositional semantics for a language of imperfect information.W. Hodges - 1997 - Logic Journal of the IGPL 5 (4):539-563.
    We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the 'information-friendly' language of Hintikka and Sandu. For first-order formulas the semantics reduces to Tarski's semantics for first-order logic. We prove that two formulas have the same (...)
    Download  
     
    Export citation  
     
    Bookmark   138 citations  
  • Logic, Semantics, Metamathematics: Papers from 1923 to 1938.Alfred Tarski & John Corcoran (eds.) - 1983 - New York, NY, USA: Hackett Publishing Company.
    Published with the aid of a grant from the National Endowment for the Humanities. Contains the only complete English-language text of The Concept of Truth in Formalized Languages. Tarski made extensive corrections and revisions of the original translations for this edition, along with new historical remarks. It includes a new preface and a new analytical index for use by philosophers and linguists as well as by historians of mathematics and philosophy.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Anaphora and Definite Descriptions: Two Applications of Game-Theoretical Semantics.Jaakko Hintikka, Kaarlo Jaakko Juhani Hintikka & J. Kulas - 1985 - Springer.
    I n order to appreciate properly what we are doing in this book it is necessary to realize that our approach to linguistic theorizing differs from the prevailing views. Our approach can be described by indicating what distinguishes it from the methodological ideas current in theoretical linguistics, which I consider seriously misguided. Linguists typically construe their task in these days as that of making exceptionless generalizations from particular examples. This explanatory strategy is wrong in several different ways. It presupposes that (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • A Revolution In Logic?Jaakko Hintikka & Gabriel Sandu - 1996 - Nordic Journal of Philosophical Logic 1:169-183.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Hintikka on the Foundations of Mathematics: IF Logic and Uniformity Concepts.André Bazzoni - 2015 - Journal of Philosophical Logic 44 (5):507-516.
    The initial goal of the present paper is to reveal a mistake committed by Hintikka in a recent paper on the foundations of mathematics. His claim that independence-friendly logic is the real logic of mathematics is supported in that article by an argument relying on uniformity concepts taken from real analysis. I show that the central point of his argument is a simple logical mistake. Second and more generally, I conclude, based on the previous remarks and on another standard fact (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Game-Theoretical Semantics as a challenge to proof theory.Jaakko Hintikka - 1999 - Nordic Journal of Philosophical Logic 4:127-142.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Partially ordered connectives and finite graphs.Lauri Hella & Gabriel Sandu - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 79--88.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Probabilistic IF Logic.Gabriel Sandu - 2013 - In Kamal Lodaya (ed.), Logic and Its Applications. Springer. pp. 69--79.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On existential declarations of independence in if logic.Fausto Barbero - 2013 - Review of Symbolic Logic 6 (2):254-280.
    We analyze the behaviour of declarations of independence between existential quantifiers in quantifier prefixes of Independence-Friendly (IF) sentences; we give a syntactical criterion to decide whether a sentence beginning with such prefix exists, such that its truth values may be affected by removal of the declaration of independence. We extend the result also to equilibrium semantics values for undetermined IF sentences.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Hierarchies of Partially Ordered Connectives and Quantifiers.Michał Krynicki - 1993 - Mathematical Logic Quarterly 39 (1):287-294.
    Connections between partially ordered connectives and Henkin quantifiers are considered. It is proved that the logic with all partially ordered connectives and the logic with all Henkin quantifiers coincide. This implies that the hierarchy of partially ordered connectives is strongly hierarchical and gives several nondefinability results between some of them. It is also deduced that each Henkin quantifier can be defined by a quantifier of the form equation imagewhat is a strengthening of the Walkoe result. MSC: 03C80.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Henkin Quantifiers.M. Krynicki & M. Mostowski - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 193--263.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • How indefinites choose their scope.Adrian Brasoveanu & Donka F. Farkas - 2011 - Linguistics and Philosophy 34 (1):1-55.
    The paper proposes a novel solution to the problem of scope posed by natural language indefinites that captures both the difference in scopal freedom between indefinites and bona fide quantifiers and the syntactic sensitivity that the scope of indefinites does nevertheless exhibit. Following the main insight of choice functional approaches, we connect the special scopal properties of indefinites to the fact that their semantics can be stated in terms of choosing a suitable witness. This is in contrast to bona fide (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Independence-friendly logic: a game-theoretic approach.Allen L. Mann - 2011 - New York: Cambridge University Press. Edited by Gabriel Sandu & Merlijn Sevenster.
    A systematic introduction suitable for readers who have little familiarity with logic. Provides numerous examples and complete proofs.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
    An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • A Remark on Henkin Sentences and Their Contraries.John P. Burgess - 2003 - Notre Dame Journal of Formal Logic 44 (3):185-188.
    That the result of flipping quantifiers and negating what comes after, applied to branching-quantifier sentences, is not equivalent to the negation of the original has been known for as long as such sentences have been studied. It is here pointed out that this syntactic operation fails in the strongest possible sense to correspond to any operation on classes of models.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Partially ordered connectives and monadic monotone strict np.Lauri Hella, Merlijn Sevenster & Tero Tulenheimo - 2008 - Journal of Logic, Language and Information 17 (3):323-344.
    Motivated by constraint satisfaction problems, Feder and Vardi (SIAM Journal of Computing, 28, 57–104, 1998) set out to search for fragments of satisfying the dichotomy property: every problem definable in is either in P or else NP-complete. Feder and Vardi considered in this connection two logics, strict NP (or SNP) and monadic, monotone, strict NP without inequalities (or MMSNP). The former consists of formulas of the form , where is a quantifier-free formula in a relational vocabulary; and the latter is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On mathematical proofs of the vacuity of compositionality.dag westerståhl - 1998 - Linguistics and Philosophy 21 (6):635-643.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
    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.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • If-logic and truth-definition.Gabriel Sandu - 1998 - Journal of Philosophical Logic 27 (2):143-164.
    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.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Aspects of compositionality.Gabriel Sandu & Jaakko Hintikka - 2001 - Journal of Logic, Language and Information 10 (1):49-61.
    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.
    Download  
     
    Export citation  
     
    Bookmark   15 citations