Automatic sequence: Difference between revisions
en>Braincricket →Examples: Typo fixing, typos fixed: , → , using AWB (8062) |
en>Gandalf61 →Substitution point of view: k is used as base in rest of article |
||
Line 1: | Line 1: | ||
{{Other uses|Closure (disambiguation){{!}}Closure}} | |||
'''Deductive closure''' is a [[property (philosophy)|property]] of a [[set (mathematics)|set]] of [[object (philosophy)|objects]] (usually the objects in question are [[statement (logic)|statement]]s). A [[set (mathematics)|set]] of objects, <var>O</var>, is said to exhibit ''closure'' or to be ''closed'' under a given [[closure operator|operation]], <var>R</var>, provided that for every object, <var>x</var>, if <var>x</var> is a member of <var>O</var> and <var>x</var> is <var>R</var>-related to any object, <var>y</var>, then <var>y</var> is a member of <var>O</var>.<ref>[[Peter D. Klein]], ''Closure'', ''[[The Cambridge Dictionary of Philosophy]] (second edition)</ref> In the context of statements, a deductive closure is the set of all the statements that can be [[Deductive reasoning|deduced]] from a given set of statements. | |||
In [[propositional calculus|propositional logic]], the set of all true propositions exhibits '''deductive closure''': if set <var>O</var> is the set of true propositions, and operation <var>R</var> is [[logical consequence]] (“<math>\vdash</math>”), then provided that proposition <var>p</var> is a member of <var>O</var> and <var>p</var> is <var>R</var>-related to <var>q</var> (i.e., p <math>\vdash</math> q), <var>q</var> is also a member of <var>O</var>. | |||
== Epistemic closure == | |||
{{main|Epistemic closure}} | |||
In [[epistemology]], many philosophers have and continue to debate whether particular subsets of [[proposition]]s—especially ones ascribing [[knowledge]] or [[Theory of justification|justification]] of a [[belief]] to a subject—are closed under deduction. | |||
==References== | |||
{{reflist}} | |||
[[Category:Concepts in logic]] | |||
[[Category:Deductive reasoning|Closure]] | |||
[[Category:Logical consequence]] | |||
[[Category:Propositional calculus]] | |||
[[Category:Set theory]] |
Revision as of 10:32, 22 April 2013
I'm Fernando (21) from Seltjarnarnes, Iceland.
I'm learning Norwegian literature at a local college and I'm just about to graduate.
I have a part time job in a the office.
my site; wellness [continue reading this..]
Deductive closure is a property of a set of objects (usually the objects in question are statements). 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.[1] In the context of statements, a deductive closure is the set of all the statements that can be deduced from a given set of statements.
In propositional logic, the set of all true propositions exhibits deductive closure: if set O is the set of true propositions, and operation R is logical consequence (“”), 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.
Epistemic closure
Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church.
In 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.
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
- ↑ Peter D. Klein, Closure, The Cambridge Dictionary of Philosophy (second edition)