Logical consequence

"Entailment" redirects here. For other uses, see Entail (disambiguation).

"Therefore" redirects here. For the therefore symbol (∴), see Therefore sign.

"Logical implication" redirects here. For the binary connective, see Material conditional.

Logical consequence (also entailment) is one of the most fundamental concepts in logic. It is the relationship between statements that holds true when one logically "follows from" one or more others. A valid logical argument is one in which the conclusions follow from its premises, and its conclusions are consequences of its premises. The philosophical analysis of logical consequence involves asking, 'in what sense does a conclusion follow from its premises?' and 'what does it mean for a conclusion to be a consequence of premises?'^[1] All of philosophical logic can be thought of as providing accounts of the nature of logical consequence, as well as logical truth.^[2]

Logical consequence is taken to be both necessary and formal with examples explicated using models and proofs.^[1] A sentence is said to be a logical consequence of a set of sentences, for a given language, if and only if, using logic alone (i.e. without regard to any interpretations of the sentences) the sentence must be true if every sentence in the set were to be true.^[3]

Logicians make precise accounts of logical consequence with respect to a given language $\mathcal{L}$ by constructing a deductive system for $\mathcal{L}$ , or by formalizing the intended semantics for $\mathcal{L}$ . Alfred Tarski highlighted three salient features for which any adequate characterization of logical consequence needs to account: 1) that the logical consequence relation relies on the logical form of the sentences involved, 2) that the relation is a priori, i.e. it can be determined whether or not it holds without regard to sense experience, and 3) that the relation has a modal component.^[3]

Formal accounts

The most widely prevailing view on how to best 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 $A$ are $B$ . All $C$ are $A$ . Therefore, All $C$ are $B$ ." This argument is formally valid, because every instance of arguments constructed using this scheme are 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 $Q$ 's brother's son, therefore $P$ is $Q$ 's nephew" is valid in all cases, but is not a formal argument.^[1]

A priori property of logical consequence

If you know that $Q$ follows logically from $P$ 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.^[1] Deductively valid arguments can be known to be so without recourse to experience, so they must be knowable a priori.^[1] 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.^[1]

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.^[4]

Syntactic consequence

Semantic consequence

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't 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 such as Michael Dummett.

Non-monotonic logical consequence

Main article: Non-monotonic logic

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

For more on this, see Belief revision#Non-monotonic inference relation.

Notes

1 2 3 4 5 6 Beall, JC and Restall, Greg, Logical Consequence The Stanford Encyclopedia of Philosophy (Fall 2009 Edition), Edward N. Zalta (ed.).
↑ Quine, Willard Van Orman, Philosophy of logic
1 2 McKeon, Matthew, Logical Consequence Internet Encyclopedia of Philosophy.
↑ Kosta Dosen (1996). "Logical consequence: a turn in style". In Maria Luisa Dalla Chiara, Kees Doets, Daniele Mundici, Johan van Benthem. Logic and Scientific Methods: Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995. Springer. p. 292. ISBN 978-0-7923-4383-7.
↑ Dummett, Michael (1993) Frege: philosophy of language Harvard University Press, p.82ff
↑ Lear, Jonathan (1986) Aristotle and Logical Theory Cambridge University Press, 136p.
↑ Creath, Richard, and Friedman, Michael (2007) The Cambridge companion to Carnap Cambridge University Press, 371p.
↑ FOLDOC: "syntactic consequence"
↑ Hunter, Geoffrey, Metalogic: An Introduction to the Metatheory of Standard First-Order Logic, University of California Pres, 1971, p. 75.
↑ Etchemendy, John, Logical consequence, The Cambridge Dictionary of Philosophy

Resources

Anderson, A.R.; Belnap, N.D., Jr. (1975), Entailment 1, Princeton, NJ: Princeton .
Barwise, Jon; Etchemendy, John (2008), Language, Proof and Logic, Stanford: CSLI Publications .
Brown, Frank Markham (2003), Boolean Reasoning: The Logic of Boolean Equations 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY, 2003.
Davis, Martin, (editor) (1965), The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions, New York: Raven Press . Papers include those by Gödel, Church, Rosser, Kleene, and Post.
Dummett, Michael (1991), The Logical Basis of Metaphysics, Harvard University Press .
Edgington, Dorothy (2001), Conditionals, Blackwell in Lou Goble (ed.), The Blackwell Guide to Philosophical Logic.
Edgington, Dorothy (2006), Conditionals in Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy.
Etchemendy, John (1990), The Concept of Logical Consequence, Harvard University Press .
Goble, Lou, ed. (2001), The Blackwell Guide to Philosophical Logic, Blackwell .
Hanson, William H (1997), "The concept of logical consequence", The Philosophical Review 106 365–409.
Hendricks, Vincent F. (2005), Thought 2 Talk: A Crash Course in Reflection and Expression, New York: Automatic Press / VIP, ISBN 87-991013-7-8
Planchette, P. A. (2001), Logical Consequence in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell.
Quine, W.V. (1982), Methods of Logic, Cambridge, MA: Harvard University Press (1st ed. 1950), (2nd ed. 1959), (3rd ed. 1972), (4th edition, 1982).
Shapiro, Stewart (2002), Necessity, meaning, and rationality: the notion of logical consequence in D. Jacquette, ed., A Companion to Philosophical Logic. Blackwell.
Tarski, Alfred (1936), On the concept of logical consequence 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
Ryszard Wójcicki (1988). Theory of Logical Calculi: Basic Theory of Consequence Operations. Springer. ISBN 978-90-277-2785-5.

External links

Logical consequence entry in the Stanford Encyclopedia of Philosophy
Logical consequence at the Indiana Philosophy Ontology Project
Logical consequence entry in the Internet Encyclopedia of Philosophy
Logical consequence at PhilPapers
Hazewinkel, Michiel, ed. (2001), "Implication", Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4

Logic

Fields

Foundations

Lists

topics	Mathematical logic Boolean algebra Set theory

other	Logicians Rules of inference Paradoxes Fallacies Logic symbols

Portal
Category
WikiProject (talk)
changes

Mathematical logic

General	Formal language Formation rule Formal system Deductive system Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Natural deduction Rule of inference Relation Theorem Logical consequence Axiomatic system Type theory Symbol Syntax Theory

Traditional logic	Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram

Propositional calculus Boolean logic	Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables

Predicate logic	First-order Quantifiers Predicate Second-order Monadic predicate calculus

Naive set theory	Set Empty set Enumeration Extensionality Finite set Infinite set Subset Power set Countable set Uncountable set Recursive set Domain Range Map Function Relation Ordered pair

Set theory	Foundations of mathematics Zermelo–Fraenkel set theory Axiom of choice General set theory Kripke–Platek set theory Von Neumann–Bernays–Gödel set theory Morse–Kelley set theory Tarski–Grothendieck set theory

Model theory	Model Interpretation Non-standard model Finite model theory Truth value Validity

Proof theory	Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax

Computability theory	Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function

Logical connectives

Tautology $\top$

NAND $\uparrow$ Converse implication $\leftarrow$ Implication $\rightarrow$ OR $\or$

Negation $\neg$ XOR $\oplus$ Biconditional $\leftrightarrow$ Statement

NOR $\downarrow$ Nonimplication $\nrightarrow$ Converse nonimplication $\nleftarrow$ AND $\and$

Contradiction $\bot$

This article is issued from Wikipedia - version of the Monday, September 21, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.