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  
  • (1 other version)An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Negation and partial axiomatizations of dependence and independence logic revisited.Fan Yang - 2019 - Annals of Pure and Applied Logic 170 (9):1128-1149.
    In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in [22] and [11]. We prove a characterization theorem for negatable formulas in independence logic and negatable sentences in dependence logic, and identify an interesting class of formulas that are negatable in independence logic. Dependence and independence atoms, first-order formulas belong to this class. We also demonstrate our extended system of independence logic by giving explicit derivations (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Inclusion and exclusion dependencies in team semantics—on some logics of imperfect information.Pietro Galliani - 2012 - Annals of Pure and Applied Logic 163 (1):68-84.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • (2 other versions)Contents.Andrés Villaveces, Roman Kossak, Juha Kontinen & Åsa Hirvonen - 2015 - In Asa Hirvonen, Juha Kontinen, Roman Kossak & Andres Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. Boston: De Gruyter.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Capturing k-ary existential second order logic with k-ary inclusion–exclusion logic.Raine Rönnholm - 2018 - Annals of Pure and Applied Logic 169 (3):177-215.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On Natural Deduction in Dependence Logic. [REVIEW]Juha Kontinen - 2015 - In Asa Hirvonen, Juha Kontinen, Roman Kossak & Andres Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. Boston: De Gruyter. pp. 297-304.
    Download  
     
    Export citation  
     
    Bookmark   2 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  
  • 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   140 citations  
  • Axiomatizing first-order consequences in independence logic.Miika Hannula - 2015 - Annals of Pure and Applied Logic 166 (1):61-91.
    Download  
     
    Export citation  
     
    Bookmark   6 citations