Misplaced Pages

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.

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. ${\displaystyle \forall xA\Rightarrow \exists xA}$

2. ${\displaystyle \forall x\forall rA(x)\Rightarrow \forall rA(r)}$

3. ${\displaystyle \forall rA(r)\Rightarrow \exists xA(x)}$

A valid scheme in the theory of equality which exhibits the same feature is

4. ${\displaystyle \forall x(Fx\rightarrow Gx)\land \exists xFx\rightarrow \exists x(Fx\land Gx)}$

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. ${\displaystyle \forall xA\rightarrow (E!t\rightarrow A(t/x))}$, where E! is an existence predicate (in some but not all formulations of free logic, E!t can be defined as ∃y(y=t))

Similar modifications are made to other theorems with existential import (e.g. existential generalization becomes ${\displaystyle A(r)\rightarrow (E!r\rightarrow \exists xA(x))}$.

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

Interpretation

Karel Lambert wrote in 1967: "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 ${\displaystyle \exists xFx\rightarrow (\exists x(E!x\land Fx))}$ and ${\displaystyle Fy\rightarrow (E!y\rightarrow \exists xFx)}$, 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, which is that to exist is to be self-identical.

See also

• Logical cube
• Logical hexagon
• Square of opposition
• Triangle of opposition
• Table of logic symbols

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. ^ 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.

References

• Lambert, Karel (2003). Free logic: Selected essays. Cambridge Univ. Press. ISBN 9780511039195.
• ———, 2001, "Free Logics," in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell.
• ———, 1997. Free logics: Their foundations, character, and some applications thereof. Sankt Augustin: Academia.
• ———, ed. 1991. Philosophical applications of free logic. Oxford Univ. Press.
• Morscher, Edgar, and Hieke, Alexander, 2001. New essays in free logic. Dordrecht: Kluwer.

External links

• Nolt, John. "Free logic". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy.

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

• Non-classical logic