Logical consequence

Formal accounts

The most widely prevailing view on how best to account for logical consequence is to appeal to formality. This is to say that whether statements follow from one another logically depends on the structure or logical form of the statements without regard to the contents of that form.

Syntactic accounts of logical consequence rely on schemes using inference rules. For instance, we can express the logical form of a valid argument as:

: All X are Y : All Y are Z : Therefore, all X are Z.

This argument is formally valid, because every instance of arguments constructed using this scheme is valid.

This is in contrast to an argument like "Fred is Mike's brother's son. Therefore Fred is Mike's nephew." Since this argument depends on the meanings of the words "brother", "son", and "nephew", the statement "Fred is Mike's nephew" is a so-called material consequence of "Fred is Mike's brother's son", not a formal consequence. A formal consequence must be true in all cases, however this is an incomplete definition of formal consequence, since even the argument "P is Qs brother's son, therefore P is Qs nephew" is valid in all cases, but is not a formal argument.

A priori property

If it is known that Q follows logically from P, then no information about the possible interpretations of P or Q will affect that knowledge. Our knowledge that Q is a logical consequence of P cannot be influenced by empirical knowledge. Deductively valid arguments can be known to be so without recourse to experience, so they must be knowable a priori. However, formality alone does not guarantee that logical consequence is not influenced by empirical knowledge. So the a priori property of logical consequence is considered to be independent of formality.

Proofs and models

The two prevailing techniques for providing accounts of logical consequence involve expressing the concept in terms of proofs and via models. The study of the syntactic consequence (of a logic) is called (its) proof theory whereas the study of (its) semantic consequence is called (its) model theory.

Syntactic consequence

A formula A is a syntactic consequence within some formal system \mathcal{FS} of a set \Gamma of formulas if there is a formal proof in \mathcal{FS} of A from the set \Gamma. This is denoted \Gamma \vdash_{\mathcal {FS} } A. The turnstile symbol \vdash was originally introduced by Frege in 1879, but its current use only dates back to Rosser and Kleene (1934–1935).

Syntactic consequence does not depend on any interpretation of the formal system.

Semantic consequence

A formula A is a semantic consequence within some formal system \mathcal{FS} of a set of statements \Gamma if and only if there is no model \mathcal{I} in which all members of \Gamma are true and A is false. This is denoted \Gamma \models_{\mathcal {FS} } A. Or, in other words, the set of the interpretations that make all members of \Gamma true is a subset of the set of the interpretations that make A true.

Modal accounts

Modal accounts of logical consequence are variations on the following basic idea:

:\Gamma \vdash A is true if and only if it is necessary that if all of the elements of \Gamma are true, then A is true.

Alternatively (and, most would say, equivalently):

:\Gamma \vdash A is true if and only if it is impossible for all of the elements of \Gamma to be true and A false.

Such accounts are called "modal" because they appeal to the modal notions of logical necessity and logical possibility. 'It is necessary that' is often expressed as a universal quantifier over possible worlds, so that the accounts above translate as:

:\Gamma \vdash A is true if and only if there is no possible world at which all of the elements of \Gamma are true and A is false (untrue).

Consider the modal account in terms of the argument given as an example above:

:All frogs are green. :Kermit is a frog. :Therefore, Kermit is green.

The conclusion is a logical consequence of the premises because we can not imagine a possible world where (a) all frogs are green; (b) Kermit is a frog; and (c) Kermit is not green.

Modal-formal accounts

Modal-formal accounts of logical consequence combine the modal and formal accounts above, yielding variations on the following basic idea:

:\Gamma \vdash A if and only if it is impossible for an argument with the same logical form as \Gamma/A to have true premises and a false conclusion.

Warrant-based accounts

The accounts considered above are all "truth-preservational", in that they all assume that the characteristic feature of a good inference is that it never allows one to move from true premises to an untrue conclusion. As an alternative, some have proposed "warrant-preservational" accounts, according to which the characteristic feature of a good inference is that it never allows one to move from justifiably assertible premises to a conclusion that is not justifiably assertible. This is (roughly) the account favored by intuitionists.

Non-monotonic logical consequence

The accounts discussed above all yield monotonic consequence relations, i.e. ones such that if A is a consequence of \Gamma, then A is a consequence of any superset of \Gamma. It is also possible to specify non-monotonic consequence relations to capture the idea that, e.g., 'Tweety can fly' is a logical consequence of

:{Birds can typically fly, Tweety is a bird}

but not of

:{Birds can typically fly, Tweety is a bird, Tweety is a penguin}.

Notes

Resources

• .
• London: College Publications. Series: Mathematical logic and foundations.
• .
• 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY, 2003.
• . Papers include those by Gödel, Church, Rosser, Kleene, and Post.
• .
• in Lou Goble (ed.), The Blackwell Guide to Philosophical Logic.
• in Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy.
• .
• .
• 365–409.
• in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell.
• (1st ed. 1950), (2nd ed. 1959), (3rd ed. 1972), (4th edition, 1982).
• in D. Jacquette, ed., A Companion to Philosophical Logic. Blackwell.
• Reprinted in Tarski, A., 1983. Logic, Semantics, Metamathematics, 2nd ed. Oxford University Press. Originally published in Polish and German.
• A paper on 'implication' from math.niu.edu, Implication
• A definition of 'implicant' AllWords

References

1. Beall, JC and Restall, Greg, ''[http://plato.stanford.edu/archives/fall2009/entries/logical-consequence/ Logical Consequence]'' The Stanford Encyclopedia of Philosophy (Fall 2009 Edition), Edward N. Zalta (ed.).
2. [[Willard Van Orman Quine. Quine, Willard Van Orman]], ''Philosophy of Logic''.
3. McKeon, Matthew, ''[http://www.iep.utm.edu/logcon/ Logical Consequence]'' Internet Encyclopedia of Philosophy.
4. Kosta Dosen. (1996). "Logic and Scientific Methods: Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995". Springer.
5. [[Michael Dummett
6. [[Jonathan Lear
7. Creath, Richard, and [[Michael Friedman (philosopher)
8. [http://www.swif.uniba.it/lei/foldop/foldoc.cgi?syntactic+consequence FOLDOC: "syntactic consequence"] {{webarchive. link. (2013-04-03)
9. S. C. Kleene, ''[https://www.worldcat.org/oclc/523942 Introduction to Metamathematics]'' (1952), Van Nostrand Publishing. p.88.
10. {{Hunter 1996
11. [[John Etchemendy. Etchemendy, John]], ''Logical consequence'', The Cambridge Dictionary of Philosophy