Switch to: References

Add citations

You must login to add citations.
  1. 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 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Independence-friendly logic and axiomatic set theory.Jaakko Hintikka - 2004 - Annals of Pure and Applied Logic 126 (1-3):313-333.
    In order to be able to express all possible patterns of dependence and independence between variables, we have to replace the traditional first-order logic by independence-friendly (IF) logic. Our natural concept of truth for a quantificational sentence S says that all the Skolem functions for S exist. This conception of truth for a sufficiently rich IF first-order language can be expressed in the same language. In a first-order axiomatic set theory, one can apparently express this same concept in set-theoretical terms, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.
  • Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.