Switch to: Citations

Add references

You must login to add references.
  1. (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  
  • Finite partially-ordered quantification.Wilbur John Walkoe - 1970 - Journal of Symbolic Logic 35 (4):535-555.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Distributive Normal Forms in the Calculus of Predicates.Jaakko Hintikka - 1953 - [Edidit Societas Philosophica;,] [Distribuit Akatesminen Kirjakauppa,].
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Truth in a Structure.Wilfrid Hodges - 1986 - Proceedings of the Aristotelian Society 86:135 - 151.
    Wilfrid Hodges; VIII*—Truth in a Structure, Proceedings of the Aristotelian Society, Volume 86, Issue 1, 1 June 1986, Pages 135–152, https://doi.org/10.1093/ari.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • Tarski’s Guilty Secret: Compositionality.Jaakko Hintikka & Gabriel Sandu - 1999 - Vienna Circle Institute Yearbook 6:217-230.
    Tarski has exerted enormous influence not only on the development of mathematical logic, but on twentieth-century philosophy and philosophical analysis. This influence has been twofold, with the two components pulling in a sense in opposite directions. A comparison with the influence of the Vienna Circle provides an instructive vantage point in viewing Tarski’s influence. On the one hand, Tarski has provided powerful tools for logical analysis in philosophy. His first and most important contribution was to show that — and how (...)
    Download  
     
    Export citation  
     
    Bookmark   6 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  
  • 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  
  • Negation in logic and in natural language.Jaakko Hintikka - 2002 - Linguistics and Philosophy 25 (5-6):585-600.
    In game-theoretical semantics, perfectlyclassical rules yield a strong negation thatviolates tertium non datur when informationalindependence is allowed. Contradictorynegation can be introduced only by a metalogicalstipulation, not by game rules. Accordingly, it mayoccur (without further stipulations) onlysentence-initially. The resulting logic (extendedindependence-friendly logic) explains several regularitiesin natural languages, e.g., why contradictory negation is abarrier to anaphase. In natural language, contradictory negationsometimes occurs nevertheless witin the scope of aquantifier. Such sentences require a secondary interpretationresembling the so-called substitutionalinterpretation of quantifiers.This interpretation is sometimes impossible,and (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)Completeness in the theory of types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
    Download  
     
    Export citation  
     
    Bookmark   202 citations  
  • Finite Partially‐Ordered Quantifiers.Herbert B. Enderton - 1970 - Mathematical Logic Quarterly 16 (8):393-397.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • A Revolution In Logic?Jaakko Hintikka & Gabriel Sandu - 1996 - Nordic Journal of Philosophical Logic 1:169-183.
    Download  
     
    Export citation  
     
    Bookmark   9 citations