Hyperclassical logic (A.K.A. IF logic) and its implications for logical theory

Bulletin of Symbolic Logic 8 (3):404-423 (2002)
  Copy   BIBTEX

Abstract

Let us assume that you are entrusted by UNESCO with an important task. You are asked to devise a universal logical language, a Begriffsschrift in Frege's sense, which is to serve the purposes of science, business and everyday life. What requirements should such a “conceptual notation” satisfy? There are undoubtedly many relevant desiderata, but here I am focusing on one unmistakable one. In order to be a viable lingua universalis, your language must in any case be capable of representing any possible configuration of dependence and independence between different variables. For if such a configuration is possible in principle, there is no guarantee that it might not one day show up among the natural, human or social phenomena we have to study.But how are dependencies and independencies between variables expressed in our familiar logical notation? Every logician worth his or her truth-table knows the answer. Dependencies between two variables are expressed by dependencies between the quantifiers to which they are bound. For instance, inthe variable y depends on x, while inz depends on x but not on y, while u depends on both x and y.But how is the dependence of a quantifier on another one expressed in familiar logical languages? Obviously by occurring in its scope, indicated by the pair of parentheses following it. But the nesting of scopes is a transitive and antisymmetrical relation which allows branching only in one direction. Hence other kinds of structures of dependence and independence between variables are not representable in the received logical notation. Such previously inexpressible structures form the subject matter of what has been referred to as independence-friendly logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
64 (#248,320)

6 months
7 (#418,426)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

From if to bi.Samson Abramsky & Jouko Väänänen - 2009 - Synthese 167 (2):207 - 230.
Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
In the Beginning was Game Semantics?Giorgi Japaridze - 2009 - In Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.), Games: Unifying Logic, Language, and Philosophy. Springer Verlag. pp. 249--350.
Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.
Truth, negation and other basic notions of logic.Jaakko Hintikka - 2006 - In Johan van Benthem, Gerhard Heinzman, M. Rebushi & H. Visser (eds.), The Age of Alternative Logics. Springer. pp. 195--219.

View all 17 citations / Add more citations

References found in this work

On branching quantifiers in English.Jon Barwise - 1979 - Journal of Philosophical Logic 8 (1):47 - 80.
Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
Finite Partially‐Ordered Quantifiers.Herbert B. Enderton - 1970 - Mathematical Logic Quarterly 16 (8):393-397.
No scope for scope?Jaakko Hintikka - 1997 - Linguistics and Philosophy 20 (5):515-544.
Critical Studies / Book Reviews. [REVIEW]N. Tennant - 1998 - Philosophia Mathematica 6 (1):90-90.

Add more references