A set of objects, O, is said to exhibit closure or to be closed under a given operation, R, provided that for every object, x, if x is a member of O and x is R-related to any object, y, then y is a member of O. [links not in original]
In propositional logic, the set of all propositions exhibits deductive closure: if set O is the set of propositions, and operation R is logical entailment (“”), then provided that proposition p is a member of O and p is R-related to q (i.e., p q), q is also a member of O. In the philosophical branch of epistemology, many philosophers have and continue to debate whether particular subsets of propositions—especially ones ascribing knowledge or justification of a belief to a subject—are closed under deduction.
It is not the case that knowledge is closed under deduction; that is, if person S knows p, and p entails q, then S knows q (sometimes called the straight principle).  A subject may not actually believe q, for example, regardless of whether he or she is justified or warranted. Thus, one might instead say that knowledge is closed under known deduction: if, while knowing p, S believes q because S knows that p entails q, then S knows q. An even stronger formulation would be as such: If, while knowing various propositions, S believes p because S knows that they entail p, then S knows p. While the principle of epistemic closure is generally regarded as intuitive, philosophers such as Robert Nozick and Fred Dretske have argued against it.
In the seminal 1963 paper, “Is Justified True Belief Knowledge?”, Edmund Gettier gave an assumption (later called the “principle of deducibility for justification” by Irving Thalberg Jr.) that would serve as a basis for the rest of his piece: “for any proposition P, if S is justified in believing P and P entails Q, and S deduces Q from P and accepts Q as a result of this deduction, then S is justified in believing Q.” This was seized upon by Thalberg, who rejected the principle in order to demonstrate that one of Gettier's examples fails to support Gettier's main thesis that justified true belief is not knowledge (in the following quotation, (1) refers to “Jones will get the job”, (2) refers to “Jones has ten coins”, and (3) is the logical conjunction of (1) and (2)):
Why doesn't Gettier's principle (PDJ) hold in the evidential situation he has described? You multiply your risks of being wrong when you believe a conjunction. [… T]he most elementary theory of probability indicates that Smith's prospects of being right on both (1) and (2), namely, of being right on (3), are bound to be less favorable than his prospects of being right on either (1) or (2). In fact, Smith's chances of being right on (3) might not come up to the minimum standard of justification which (1) and (2) barely satisfy, and Smith would be unjustified in accepting (3). [Thalberg p. 798]
- ^ a b c Luper, Steven. “The Epistemic Closure Principle.” Stanford Encyclopedia of Philosophy. Dec 31, 2001. http://plato.stanford.edu/entries/closure-epistemic/#CloPri (accessed November 2, 2006).
- ^ Brady, Michael, and Duncan Pritchard. “Epistemological Contextualism: Problems and Prospects.” The Philosophical Quarterly 55, no. 219 (2005): 161–171.
- ^ Thalberg Jr., Irving. “In Defense of Justified True Belief.” Journal of Philosophy, 66, no. 22 (1969): 794–803.
- ^ Gettier, Edmund. “Is Justified True Belief Knowledge?” Analysis, 23, no. 6 (1963): 121–123.
Wikimedia Foundation. 2010.
Look at other dictionaries:
deductive closure — noun The set of all the statements that can be deduced from a given set of statements … Wiktionary
Closure — may refer to: Closure (container) used to seal a bottle, jug, jar, can, or other container Closure (wine bottle), a stopper Closure (business), the process by which an organization ceases operations Closure (philosophy), a principle in… … Wikipedia
Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y) (cl… … Wikipedia
List of philosophy topics (D-H) — DDaDai Zhen Pierre d Ailly Jean Le Rond d Alembert John Damascene Damascius John of Damascus Peter Damian Danish philosophy Dante Alighieri Arthur Danto Arthur C. Danto Arthur Coleman Danto dao Daodejing Daoism Daoist philosophy Charles Darwin… … Wikipedia
Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… … Wikipedia
Combinatory logic — Not to be confused with combinational logic, a topic in digital electronics. Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been… … Wikipedia
Belief revision — is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.What… … Wikipedia
Craig's theorem — In mathematical logic, Craig s theorem states that any recursively enumerable set of well formed formulas of a first order language is (primitively) recursively axiomatizable. This result is not related to the well known Craig interpolation… … Wikipedia
List of topics in epistemology — * A Defence of Common Sense * A priori and a posteriori (philosophy) * Adaptive representation * Aenesidemus * Aenesidemus (book) * Agrippa the Sceptic * Alison Wylie * Alvin Goldman * Analytic synthetic distinction * Androcentrism * Android… … Wikipedia
Robert Nozick — Full name Robert Nozick Born November 16, 1938(1938 11 16) Brooklyn, New York Died January 23, 2002 … Wikipedia