Switch to: References

Add citations

You must login to add citations.
  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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • Independendly‐Friendly Logic: Dependence and Independence of Quantifiers in Logic.Gabriel Sandu - 2012 - Philosophy Compass 7 (10):691-711.
    Independence‐Friendly logic introduced by Hintikka and Sandu studies patterns of dependence and independence of quantifiers which exceed those found in ordinary first‐order logic. The present survey focuses on the game‐theoretical interpretation of IF‐logic, including connections to solution concepts in classical game theory, but we shall also present its compositional interpretation together with its connections to notions of dependence and dependence between terms.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Remark on Negation in Dependence Logic.Juha Kontinen & Jouko Väänänen - 2011 - 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 (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • Supervenience, Dependence, Disjunction.Lloyd Humberstone - forthcoming - Logic and Logical Philosophy:1.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Epistemic Operators in Dependence Logic.Pietro Galliani - 2013 - Studia Logica 101 (2):367-397.
    The properties of the ${\forall^{1}}$ quantifier defined by Kontinen and Väänänen in [13] are studied, and its definition is generalized to that of a family of quantifiers ${\forall^{n}}$ . Furthermore, some epistemic operators δ n for Dependence Logic are also introduced, and the relationship between these ${\forall^{n}}$ quantifiers and the δ n operators are investigated.The Game Theoretic Semantics for Dependence Logic and the corresponding Ehrenfeucht- Fraissé game are then adapted to these new connectives.Finally, it is proved that the ${\forall^{1}}$ quantifier (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Thompson Transformations for If-Logic.Francien Dechesne - 2006 - Synthese 149 (2):285-309.
    In this paper we study connections between game theoretical concepts and results, and features of IF-predicate logic, extending observations from J. van Benthem (2001) for IF-propositional logic. We highlight how both characteristics of perfect recall can fail in the semantic games for IF-formulas, and we discuss the four Thompson transformations in relation with IF-logic. Many (strong) equivalence schemes for IF-logic correspond to one or more of the transformations. However, we also find one equivalence that does not fit in this picture, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.