Logical consequence

Short description: Relationship where one statement follows from another

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

"⊧" redirects here. For the symbol, see Double turnstile.

Logical consequence (also entailment or logical implication) is a fundamental concept in logic which describes the relationship between statements that hold true when one statement logically follows from one or more statements. A valid logical argument is one in which the conclusion is entailed by the premises, because the conclusion is the consequence of the premises. The philosophical analysis of logical consequence involves the following questions: 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 is meant to provide accounts of the nature of logical consequence and the nature of logical truth.[2]

Logical consequence is necessary and formal, by way of examples that explain with formal proof and models of interpretation.[1] A sentence is said to be a logical consequence of a set of sentences, for a given language, if and only if, using only logic (i.e., without regard to any personal interpretations of the sentences) the sentence must be true if every sentence in the set is true.[3]

Logicians make precise accounts of logical consequence regarding a given language ℒ, either by constructing a deductive system for ℒ or by formal intended semantics for language ℒ. The Polish logician Alfred Tarski identified three features of an adequate characterization of entailment: (1) The logical consequence relation relies on the logical form of the sentences: (2) The relation is a priori, i.e., it can be determined with or without regard to empirical evidence (sense experience); and (3) The logical consequence relation has a modal component.[3]

## Contents

* 1 Formal accounts
* 2 A priori property
* 3 Proofs and models
* 3.1 Syntactic consequence
* 3.2 Semantic consequence
* 4 Modal accounts
* 4.1 Modal-formal accounts
* 4.2 Warrant-based accounts
* 4.3 Non-monotonic logical consequence
* 5 See also
* 6 Notes
* 7 Resources
* 8 External links

## 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 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

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

A formula A is a syntactic consequence[5][6][7][8][9] within some formal system ℱ𝒮 of a set Γ of formulas if there is a formal proof in ℱ𝒮 of A from the set Γ. This is denoted Γ⊢ℱ𝒮A. The turnstile symbol ⊢ was originally introduced by Frege in 1879, but its current use only dates back to Rosser and Kleene (1934–1935).[9]

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

### Semantic consequence

See also: ⊨

A formula A is a semantic consequence within some formal system ℱ𝒮 of a set of statements Γ if and only if there is no model ℐ in which all members of Γ are true and A is false.[11] This is denoted Γ⊨ℱ𝒮A. Or, in other words, the set of the interpretations that make all members of Γ 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:

Γ ⊢ A is true if and only if it is necessary that if all of the elements of Γ are true, then A is true.

Alternatively (and, most would say, equivalently):

Γ ⊢ A is true if and only if it is impossible for all of the elements of Γ 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:

Γ ⊢ A is true if and only if there is no possible world at which all of the elements of Γ 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:

Γ ⊢ A if and only if it is impossible for an argument with the same logical form as Γ/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

See also: Philosophy:Non-monotonic logic and Belief revision § Non-monotonic inference relation

The accounts discussed above all yield monotonic consequence relations, i.e. ones such that if A is a consequence of Γ, then A is a consequence of any superset of Γ. 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}.

## See also

* Abstract algebraic logic
* Ampheck
* Boolean algebra (logic)
* Boolean domain
* Boolean function
* Boolean logic
* Causality
* Deductive reasoning
* Logic gate
* Logical graph
* Peirce's law
* Probabilistic logic
* Propositional calculus
* Sole sufficient operator
* Strawson entailment
* Strict conditional
* Tautology (logic)
* Tautological consequence
* Therefore sign
* Turnstile (symbol)
* Double turnstile
* Validity

## Notes

1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 Beall, JC and Restall, Greg, Logical Consequence The Stanford Encyclopedia of Philosophy (Fall 2009 Edition), Edward N. Zalta (ed.).
2. ↑ Quine, Willard Van Orman, Philosophy of Logic.
3. ↑ 3.0 3.1 McKeon, Matthew, Logical Consequence Internet Encyclopedia of Philosophy.
4. ↑ Kosta Dosen (1996). "Logical consequence: a turn in style". 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. https://books.google.com/books?id=TCthvF8xLIAC&pg=PA292.
5. ↑ Dummett, Michael (1993) philosophy of language Harvard University Press, p.82ff
6. ↑ Lear, Jonathan (1986) and Logical Theory Cambridge University Press, 136p.
7. ↑ Creath, Richard, and Friedman, Michael (2007) Cambridge companion to Carnap Cambridge University Press, 371p.
8. ↑ FOLDOC: "syntactic consequence"
9. ↑ 9.0 9.1 S. C. Kleene, Introduction to Metamathematics (1952), Van Nostrand Publishing. p.88.
10. ↑ Template:Hunter 1996
11. ↑ Etchemendy, John, Logical consequence, The Cambridge Dictionary of Philosophy

## Resources

* Anderson, A.R.; Belnap, N.D. Jr. (1975), Entailment, 1, Princeton, NJ: Princeton .
* Augusto, Luis M. (2017), Logical consequences. Theory and applications: An introduction. London: College Publications. Series: Mathematical logic and foundations.
* 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, ed. (1965), The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions, New York: Raven Press, ISBN 9780486432281, https://books.google.com/books?id=qW8x7sQ4JXgC&q=consequence . Papers include those by Gödel, Church, Rosser, Kleene, and Post.
* Dummett, Michael (1991), The Logical Basis of Metaphysics, Harvard University Press, ISBN 9780674537866, https://books.google.com/books?id=lvsVFxK3BPcC&q=consequence .
* Edgington, Dorothy (2001), Conditionals, Blackwell in Lou Goble (ed.), The Blackwell Guide to Philosophical Logic.
* Edgington, Dorothy (2006), "Indicative Conditionals", Conditionals, Metaphysics Research Lab, Stanford University, http://plato.stanford.edu/entries/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 (3): 365–409, doi:10.2307/2998398 365–409.
* Hendricks, Vincent F. (2005), Thought 2 Talk: A Crash Course in Reflection and Expression, New York: Automatic Press / VIP, ISBN 978-87-991013-7-5
* 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.
* Ryszard Wójcicki (1988). Theory of Logical Calculi: Basic Theory of Consequence Operations. Springer. ISBN 978-90-277-2785-5. https://archive.org/details/theoryoflogicalc0000wojc.
* A paper on 'implication' from math.niu.edu, Implication
* A definition of 'implicant' AllWords

## External links

* Beall, Jc; Restall, Greg (2013-11-19). "Logical Consequence". in Zalta, Edward N.. Stanford Encyclopedia of Philosophy (Winter 2016 ed.). https://plato.stanford.edu/entries/logical-consequence/.
* "Logical consequence". Internet Encyclopedia of Philosophy. http://www.iep.utm.edu/logcon/.
* Logical consequence at the Indiana Philosophy Ontology Project
* Logical consequence at PhilPapers
* Hazewinkel, Michiel, ed. (2001), "Implication", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=p/i050280

* v
* t
* e

Logic

* Outline
* History

Fields|

* Computer science
* Inference
* Philosophy of logic
* Proof
* Semantics
* Syntax

| Logics|

* Classical
* Informal
* Critical thinking
* Reason
* Mathematical
* Non-classical
* Philosophical

|

Theories|

* Argumentation
* Metalogic
* Metamathematics
* Set

Foundations|

* Abduction
* Analytic and synthetic propositions
* Contradiction
* Paradox
* Antinomy
* Deduction
* Deductive closure
* Definition
* Description
* Entailment
* Linguistic
* Form
* Induction
* Logical truth
* Name
* Necessity and sufficiency
* Premise
* Probability
* Reference
* Statement
* Substitution
* Truth
* Validity

Lists|

| topics|

* Mathematical logic
* Boolean algebra
* Set theory

|

other|

* Logicians
* Rules of inference
* Paradoxes
* Fallacies
* Logic symbols

*   * Category
* WikiProject (talk)
* changes

* v
* t
* e

Mathematical logic

General|

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

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

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

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* 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

* v
* t
* e

Logical connectives

* Tautology/True ⊤

* Alternative denial (NAND gate) ↑
* Converse implication <-
* Implication (IMPLY gate) ->
* Disjunction (OR gate) ∨

* Negation (NOT gate) ¬
* Exclusive or (XOR gate) ↮
* Biconditional (XNOR gate) ↔
* Statement

* Joint denial (NOR gate) ↓
* Nonimplication (NIMPLY gate) ↛
* Converse nonimplication ↚
* Conjunction (AND gate) ∧

* Contradiction/False ⊥

* v
* t
* e

Common logical symbols

∧ or &

and

¬ or ~

not

implies

implies,
superset

iff

nand

universal
quantification

existential
quantification

tautology

false,
contradiction

entails,
proves

entails,
therefore

therefore

because

|
|
|
|
|
|
|
|
|
|
|
|
|
|

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Logical consequence. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Logical_consequence&oldid=4346350"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template