Free logic

Last updated

A free logic is a logic with fewer existential presuppositions than classical logic. Free logics may allow for terms that do not denote any object. Free logics may also allow models that have an empty domain. A free logic with the latter property is an inclusive logic.

Contents

Explanation

In classical logic there are theorems that clearly presuppose that there is something in the domain of discourse. Consider the following classically valid theorems.

1.
2.
3.

A valid scheme in the theory of equality which exhibits the same feature[ clarification needed ] is

4.

Informally, if F is '=y', G is 'is Pegasus', and we substitute 'Pegasus' for y, then (4) appears to allow us to infer from 'everything identical with Pegasus is Pegasus' that something is identical with Pegasus. The problem comes from substituting nondesignating constants for variables: in fact, we cannot do this in standard formulations of first-order logic, since there are no nondesignating constants. Classically, ∃x(x=y) is deducible from the open equality axiom y=y by particularization (i.e. (3) above).

In free logic, (1) is replaced with

1b. , where E! is an existence predicate (in some but not all formulations of free logic, E!t can be defined as ∃y(y=t)) [1] [2] [3] [4]

Similar modifications are made to other theorems with existential import (e.g. existential generalization becomes .

Axiomatizations of free-logic are given by Theodore Hailperin (1957), [5] Jaakko Hintikka (1959), [6] Karel Lambert (1967), [7] and Richard L. Mendelsohn (1989). [8]

Interpretation

Karel Lambert wrote in 1967: [7] "In fact, one may regard free logic... literally as a theory about singular existence, in the sense that it lays down certain minimum conditions for that concept." The question that concerned the rest of his paper was then a description of the theory, and to inquire whether it gives a necessary and sufficient condition for existence statements.

Lambert notes the irony in that Willard Van Orman Quine so vigorously defended a form of logic that only accommodates his famous dictum, "To be is to be the value of a variable," when the logic is supplemented with Russellian assumptions of description theory. He criticizes this approach because it puts too much ideology into a logic, which is supposed to be philosophically neutral. Rather, he points out, not only does free logic provide for Quine's criterion—it even proves it! This is done by brute force, though, since he takes as axioms and , which neatly formalizes Quine's dictum. So, Lambert argues, to reject his construction of free logic requires you to reject Quine's philosophy, which requires some argument and also means that whatever logic you develop is always accompanied by the stipulation that you must reject Quine to accept the logic. Likewise, if you reject Quine then you must reject free logic. This amounts to the contribution that free logic makes to ontology.

The point of free logic, though, is to have a formalism that implies no particular ontology, but that merely makes an interpretation of Quine both formally possible and simple. An advantage of this is that formalizing theories of singular existence in free logic brings out their implications for easy analysis. Lambert takes the example of the theory proposed by Wesley C. Salmon and George Nahknikian, [9] which is that to exist is to be self-identical.

See also

Notes

  1. ↑ Reicher, Maria (1 January 2016). Zalta, Edward N. (ed.). Nonexistent Objects – The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University – via Stanford Encyclopedia of Philosophy.
  2. ↑ Parsons, Terence (1980). Nonexistent Objects . New Haven: Yale University Press. ISBN   9780300024043.
  3. ↑ Zalta, Edward N. (1983). Abstract Objects. An Introduction to Axiomatic Metaphysics. Dordrecht: Reidel.
  4. ↑ Jacquette, Dale (1996). Meinongian Logic. The Semantics of Existence and Nonexistence. Perspectives in Analytical Philosophy 11. Berlin–New York: de Gruyter.
  5. ↑ Hailperin, Theodore (1957). "A Theory of Restricted Quantification I". The Journal of Symbolic Logic. 22 (1): 19–35. doi:10.2307/2964055. JSTOR   2964055. S2CID   34062434.
  6. ↑ Hintikka, Jaako (1959). "Existential Presuppositions and Existential Commitments". The Journal of Philosophy. 56 (3): 125–137. doi:10.2307/2021988. JSTOR   2021988.
  7. 1 2 Lambert, Karel (1967). "Free logic and the concept of existence". Notre Dame Journal of Formal Logic. 8 (1–2). doi:10.1305/ndjfl/1093956251.
  8. ↑ Mendelsohn, Richard L. (1989). "Objects and existence: Reflections on free logic". Notre Dame Journal of Formal Logic. 30 (4). doi:10.1305/ndjfl/1093635243.
  9. ↑ Nakhnikian, George; Salmon, Wesley C. (1957). ""Exists" as a Predicate". The Philosophical Review. 66 (4): 535–542. doi:10.2307/2182749. JSTOR   2182749.

Related Research Articles

First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists" is a quantifier, while x is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic.

<span class="mw-page-title-main">Russell's paradox</span> Paradox in set theory

In mathematical logic, Russell's paradox is a set-theoretic paradox discovered by the British philosopher and mathematician Bertrand Russell in 1901. Russell's paradox shows that every set theory that contains an unrestricted comprehension principle leads to contradictions. The paradox had already been discovered independently in 1899 by the German mathematician Ernst Zermelo. However, Zermelo did not publish the idea, which remained known only to David Hilbert, Edmund Husserl, and other academics at the University of Göttingen. At the end of the 1890s, Georg Cantor – considered the founder of modern set theory – had already realized that his theory would lead to a contradiction, which he told Hilbert and Richard Dedekind by letter.

In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.

Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic. Some theorists conceive philosophical logic in a wider sense as the study of the scope and nature of logic in general. In this sense, philosophical logic can be seen as identical to the philosophy of logic, which includes additional topics like how to define logic or a discussion of the fundamental concepts of logic. The current article treats philosophical logic in the narrow sense, in which it forms one field of inquiry within the philosophy of logic.

In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic is in turn extended by higher-order logic and type theory.

In logic, philosophy and related fields, mereology is the study of parts and the wholes they form. Whereas set theory is founded on the membership relation between a set and its elements, mereology emphasizes the meronomic relation between entities, which—from a set-theoretic perspective—is closer to the concept of inclusion between sets.

In mathematics and logic, plural quantification is the theory that an individual variable x may take on plural, as well as singular, values. As well as substituting individual objects such as Alice, the number 1, the tallest building in London etc. for x, we may substitute both Alice and Bob, or all the numbers between 0 and 10, or all the buildings in London over 20 stories.

In formal semantics and philosophy of language, a definite description is a denoting phrase in the form of "the X" where X is a noun-phrase or a singular common noun. The definite description is proper if X applies to a unique individual or object. For example: "the first person in space" and "the 42nd President of the United States of America", are proper. The definite descriptions "the person in space" and "the Senator from Ohio" are improper because the noun phrase X applies to more than one thing, and the definite descriptions "the first man on Mars" and "the Senator from some Country" are improper because X applies to nothing. Improper descriptions raise some difficult questions about the law of excluded middle, denotation, modality, and mental content.

In formal logic, nonfirstorderizability is the inability of a natural-language statement to be adequately captured by a formula of first-order logic. Specifically, a statement is nonfirstorderizable if there is no formula of first-order logic which is true in a model if and only if the statement holds in that model. Nonfirstorderizable statements are sometimes presented as evidence that first-order logic is not adequate to capture the nuances of meaning in natural language.

In mathematical logic, positive set theory is the name for a class of alternative set theories in which the axiom of comprehension holds for at least the positive formulas.

Bastiaan Cornelis van Fraassen is a Dutch-American philosopher noted for his contributions to philosophy of science, epistemology and formal logic. He is a Distinguished Professor of Philosophy at San Francisco State University and the McCosh Professor of Philosophy Emeritus at Princeton University.

Independence-friendly logic is an extension of classical first-order logic (FOL) by means of slashed quantifiers of the form and , where is a finite set of variables. The intended reading of is "there is a which is functionally independent from the variables in ". IF logic allows one to express more general patterns of dependence between variables than those which are implicit in first-order logic. This greater level of generality leads to an actual increase in expressive power; the set of IF sentences can characterize the same classes of structures as existential second-order logic.

<span class="mw-page-title-main">Empty domain</span>

In first-order logic the empty domain is the empty set having no members. In traditional and classical logic domains are restrictedly non-empty in order that certain theorems be valid. Interpretations with an empty domain are shown to be a trivial case by a convention originating at least in 1927 with Bernays and Schönfinkel but oft-attributed to Quine 1951. The convention is to assign any formula beginning with a universal quantifier the value truth while any formula beginning with an existential quantifier is assigned the value falsehood. This follows from the idea that existentially quantified statements have existential import while universally quantified statements do not. This interpretation reportedly stems from George Boole in the late 19th century but this is debatable. In modern model theory, it follows immediately for the truth conditions for quantified sentences:

In the foundations of mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Morse–Tarski set theory (MT), Quine–Morse set theory (QM) or the system of Quine and Morse is a first-order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory restricts the bound variables in the schematic formula appearing in the axiom schema of Class Comprehension to range over sets alone, Morse–Kelley set theory allows these bound variables to range over proper classes as well as sets, as first suggested by Quine in 1940 for his system ML.

In logic a branching quantifier, also called a Henkin quantifier, finite partially ordered quantifier or even nonlinear quantifier, is a partial ordering

"On Denoting" is an essay by Bertrand Russell. It was published in the philosophy journal Mind in 1905. In it, Russell introduces and advocates his theory of denoting phrases, according to which definite descriptions and other "denoting phrases ... never have any meaning in themselves, but every proposition in whose verbal expression they occur has a meaning." This theory later became the basis for Russell's descriptivism with regard to proper names, and his view that proper names are "disguised" or "abbreviated" definite descriptions.

In mathematical logic, the ancestral relation of a binary relation R is its transitive closure, however defined in a different way, see below.

Czesław Lejewski was a Polish philosopher and logician, and a member of the Lwow-Warsaw School of Logic. He studied under Jan Łukasiewicz and Karl Popper in the London School of Economics, and W. V. O. Quine.

Karel Lambert is an American philosopher and logician at the University of California, Irvine and the University of Salzburg. He has written extensively on the subject of free logic, a term which he coined.

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula. A quantified formula must contain a bound variable and a subformula specifying a property of the referent of that variable.

References

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.