Switch to: Citations

Add references

You must login to add references.
  1. Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
  • Finite Partially-Ordered Quantification.Wilbur John Walkoe - 1975 - Journal of Symbolic Logic 40 (2):239-240.
    Direct download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Constructible falsity.David Nelson - 1949 - Journal of Symbolic Logic 14 (1):16-26.
  • Editorial Introduction.Juha Kontinen, Jouko Väänänen & Dag Westerståhl - 2013 - Studia Logica 101 (2):233-236.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finite partially-ordered quantification.Wilbur John Walkoe - 1970 - Journal of Symbolic Logic 35 (4):535-555.
  • 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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   133 citations  
  • Finite Partially‐Ordered Quantifiers.Herbert B. Enderton - 1970 - Mathematical Logic Quarterly 16 (8):393-397.
  • 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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   31 citations