Switch to: Citations

Add references

You must login to add references.
  1. Dependence and Independence.Erich Grädel & Jouko Väänänen - 2013 - Studia Logica 101 (2):399-410.
    We introduce an atomic formula ${\vec{y} \bot_{\vec{x}}\vec{z}}$ intuitively saying that the variables ${\vec{y}}$ are independent from the variables ${\vec{z}}$ if the variables ${\vec{x}}$ are kept constant. We contrast this with dependence logic ${\mathcal{D}}$ based on the atomic formula = ${(\vec{x}, \vec{y})}$ , actually equivalent to ${\vec{y} \bot_{\vec{x}}\vec{y}}$ , saying that the variables ${\vec{y}}$ are totally determined by the variables ${\vec{x}}$ . We show that ${\vec{y} \bot_{\vec{x}}\vec{z}}$ gives rise to a natural logic capable of formalizing basic intuitions about independence and dependence. (...)
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • On definability in dependence logic.Juha Kontinen & Jouko Väänänen - 2009 - Journal of Logic, Language and Information 18 (3):317-332.
    We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • From if to bi.Samson Abramsky & Jouko Väänänen - 2009 - Synthese 167 (2):207 - 230.
    We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • On maximal intermediate logics with the disjunction property.Larisa L. Maksimova - 1986 - Studia Logica 45 (1):69 - 75.
    For intermediate logics, there is obtained in the paper an algebraic equivalent of the disjunction propertyDP. It is proved that the logic of finite binary trees is not maximal among intermediate logics withDP. Introduced is a logicND, which has the only maximal extension withDP, namely, the logicML of finite problems.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Quantum Team Logic and Bell’s Inequalities.Tapani Hyttinen, Gianluca Paolini & Jouko Väänänen - 2015 - Review of Symbolic Logic 8 (4):722-742.
    A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4]. Since it is now considered empirically established that quantum mechanics violates Bell's Inequalities, we introduce a modified probability logic, that we call quantum team logic, in which Bell's Inequalities are not provable, and prove a Completeness Theorem for this logic. For this (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Complexity Results for Modal Dependence Logic.Peter Lohmann & Heribert Vollmer - 2013 - Studia Logica 101 (2):343-366.
    Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator = (). For propositional variables p 1, . . . , p n , = (p 1, . . . , p n-1, p n ) intuitively states that the value of p n is determined by those of p 1, . . . , p n-1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • General Models and Entailment Semantics for Independence Logic.Pietro Galliani - 2013 - Notre Dame Journal of Formal Logic 54 (2):253-275.
    We develop a semantics for independence logic with respect to what we will call general models. We then introduce a simpler entailment semantics for the same logic, and we reduce the validity problem in the former to the validity problem in the latter. Then we build a proof system for independence logic and prove its soundness and completeness with respect to entailment semantics.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Introduction to a general theory of elementary propositions.Emil L. Post - 1921 - American Journal of Mathematics 43 (3):163--185.
    In the general theory of logic built up by Whitehead and Russell to furnish a basis for all mathematics there is a certain subtheory which is unique in its simplicity and precision; and though all other portions of the work have their roots in this subtheory, it itself is completely independent of them. Whereas the complete theory requires for the enunciation of its propositions real and apparent variables, which represent both individuals and propositional functions of different kinds, and as a (...)
    Download  
     
    Export citation  
     
    Bookmark   102 citations  
  • Inquisitive Logic.Ivano Ciardelli & Floris Roelofsen - 2011 - Journal of Philosophical Logic 40 (1):55-94.
    This paper investigates a generalized version of inquisitive semantics. A complete axiomatization of the associated logic is established, the connection with intuitionistic logic and several intermediate logics is explored, and the generalized version of inquisitive semantics is argued to have certain advantages over the system that was originally proposed by Groenendijk (2009) and Mascarenhas (2009).
    Download  
     
    Export citation  
     
    Bookmark   62 citations  
  • Some combinatorics of imperfect information.Peter Cameron & Wilfrid Hodges - 2001 - Journal of Symbolic Logic 66 (2):673-684.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Expressing Second-order Sentences in Intuitionistic Dependence Logic.Fan Yang - 2013 - Studia Logica 101 (2):323-342.
    Intuitionistic dependence logic was introduced by Abramsky and Väänänen [1] as a variant of dependence logic under a general construction of Hodges’ (trump) team semantics. It was proven that there is a translation from intuitionistic dependence logic sentences into second order logic sentences. In this paper, we prove that the other direction is also true, therefore intuitionistic dependence logic is equivalent to second order logic on the level of sentences.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Axiomatizing first-order consequences in dependence logic.Juha Kontinen & Jouko Väänänen - 2013 - Annals of Pure and Applied Logic 164 (11):1101-1117.
    Dependence logic, introduced in Väänänen [11], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkul.G. Kreisel - 1957 - Archive for Mathematical Logic 3 (3-4):74.
    Download  
     
    Export citation  
     
    Bookmark   43 citations