|
به نام معبود
صحت
(برگرفته از ویکی پدیا، دایره المعارف رایگان)
http://en.wikipedia.org/wiki/Soundness
استاد درس: آقای دکتر قدیری
مترجم: مریم خاقانی اصفهانی
دانشجوی درس ساختمان گسسته
نیم سال دوم سال 88-89
دانشگاه اصفهان
در منطق ریاضی، یک سامانه ی منطقی دارای ویژگی صحت است، اگر وتنها اگر قواعد استنباطی آن فقط فرمول هایی را ثابت کند که به لحاظ معناشناسی آن معتبر باشد. در بیشتر موارد، آنچه در این باره مهم است این است که قاعده های آن درست باقی بمانند ، اما به طور کلی همیشه اینطور نیست. کلمه ی soundness از کلمه ی المانی ‘sund’ از Gesundheit گرفته شده، به معنای سلامتی. لذا برای اینکه بگوییم یک استدلال صحیح است به معنای این است که ، طبق ریشه یابی، بگوییم آن استدلال سالم است.
'''متن انگلیسی مقاله:'''
Soundness
From Wikipedia, the free encyclopedia
In mathematical logic, a logical system has the soundness property if and only if its inference rules prove only formulas that are valid with respect to its semantics. In most cases, this comes down to its rules having the property of preserving truth, but this is not the case in general. The word derives from the Germanic 'Sund' as in Gesundheit, meaning health. Thus to say that an argument is sound means, following the etymology, to say that the argument is healthy.
Contents
• 1 Of arguments
• 2 Of logical systems
o 2.1 Soundness
o 2.2 Strong soundness
o 2.3 Arithmetic soundness
• 3 Relation to completeness
• 4 References
[edit] Of arguments
An argument is sound if and only if
1. The argument is valid.
2. All of its premises are true.
For instance,
All men are mortal.
Socrates is a man.
Therefore, Socrates is mortal.
The argument is valid (because the conclusion is true based on the premises, that is, that the conclusion follows the premises) and since the premises are in fact true, the argument is sound.
The following argument is valid but not sound:
All organisms with wings can fly.
Penguins have wings.
Therefore, penguins can fly.
Since the first premise is actually false, the argument, though valid, is not sound.
[edit] Of logical systems
Soundness is among the most fundamental properties in mathematical logic. A soundness property provides the initial reason for counting a logical system as desirable. The completeness property means that every validity (truth) is provable. Together they imply that all and only validities are provable. Most proofs of soundness are trivial.[citation needed] For example, in an axiomatic system, proof of soundness amounts to verifying the validity of the axioms and that the rules of inference preserve validity (or the weaker property, truth). Most axiomatic systems have only the rule of modus ponens (and sometimes substitution),[citation needed] so it requires only verifying the validity of the axioms and one rule of inference. Soundness properties come in two main varieties: weak and strong soundness, of which the former is a special case of the latter.
[edit] Soundness
Soundness of a deductive system is the property that any sentence that is provable in that deductive system is also true on all interpretations or models of the semantic theory for the language upon which that theory is based. In symbols, where S is the deductive system, L the language together with its semantic theory, and P a sentence of L: if ⊢S P, then also ⊨L P. In other words, a system is sound if each of its theorems (i.e. formulas provable from the empty set) is valid in every structure of the language.
[edit] Strong soundness
Strong soundness of a deductive system is the property that any sentence P of the language upon which the deductive system is based that is derivable from a set Γ of sentences of that language is also a logical consequence of that set, in the sense that any model that makes all members of Γ true will also make P true. In symbols where Γ is a set of sentences of L: if Γ ⊢S P, then also Γ ⊨L P. Notice that in the statement of strong soundness, when Γ is empty, we have the statement of weak soundness.
[edit] Arithmetic soundness
If T is a theory whose objects of discourse can be interpreted as natural numbers, we say T is arithmetically sound if all theorems of T are actually true about the standard mathematical integers. For further information, see ω-consistent theory
[edit] Relation to completeness
The converse of the soundness property is the semantic completeness property. A deductive system with a semantic theory is strongly complete if every sentence P that is a semantic consequence of a set of sentences Γ can be derived in the deduction system from that set. In symbols: whenever Γ ⊨ P, then also Γ ⊢ P. Completeness of first-order logic was first explicitly established by Gödel, though some of the main results were contained in earlier work of Skolem.
Informally, a soundness theorem for a deductive system expresses that all provable sentences are true. Completeness states that all true sentences are provable.
Gödel's first incompleteness theorem shows that for languages sufficient for doing a certain amount of arithmetic, there can be no effective deductive system that is complete with respect to the intended interpretation of the symbolism of that language. Thus, not all sound deductive systems are complete in this special sense of completeness, in which the class of models (up to isomorphism) is restricted to the intended one. The original completeness proof applies to all classical models, not some special proper subclass of intended ones.
[edit] References
Logic portal
• Hinman, P. (2005). Fundamentals of Mathematical Logic. A K Peters. ISBN 1-568-81262-0.
• Irving Copi. Symbolic Logic, Vol. 5, Macmillian Publishing Co., 1979.
• Boolos, Burgess, Jeffrey. Computability and Logic, Vol. 4, Cambridge, 2002.
[show]
v • d • e
Logic
Related articles
Academic areas Argumentation theory • Axiology • Critical thinking • Computability theory • Formal semantics • History of logic • Informal logic • Logic in computer science • Mathematical logic • Mathematics • Metalogic • Metamathematics • Model theory • Philosophical logic • Philosophy • Philosophy of logic • Philosophy of mathematics • Proof theory • Set theory
Foundational concepts Abduction • Analytic truth • Antinomy • A priori • Deduction • Definition • Description • Entailment • Induction • Inference • Logical consequence • Logical form • Logical implication • Logical truth • Name • Necessity • Meaning • Paradox • Possible world • Presupposition • Probability • Reason • Reasoning • Reference • Semantics • Statement • Syntax • Truth • Truth value • Validity
Philosophical logic
Critical thinking and Informal logic
Analysis • Ambiguity • Belief • Credibility • Evidence • Explanation • Explanatory power • Fact • Fallacy • Inquiry • Opinion • Parsimony • Premise • Propaganda • Prudence • Reasoning • Relevance • Rhetoric • Rigor • Vagueness
Theories of deduction
Constructivism • Dialetheism • Fictionalism • Finitism • Formalism • Intuitionism • Logical atomism • Logicism • Nominalism • Platonic realism • Pragmatism • Realism
Metalogic and Metamathematics
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 logic and Boolean logic
Boolean functions • Propositional calculus • Propositional formula • Logical connectives • Quantifiers • Truth tables
Predicate
First-order • Quantifiers • Predicate • Second-order • Monadic predicate calculus •
Set theory
Set • Empty set • Enumeration • Extensionality • Finite set • Function • Subset • Power set • Countable set • Decidable set • Domain • Range • Ordered pair • Uncountable set
Model theory
Model • Interpretation • Logical validity • Non-standard model • Normal model • Semantic consequence • Truth value •
Proof theory
Formal proof • Deductive system • Formal system • Formal theorem • Syntactic consequence • Syntax • Transformation rules
Computability theory
Recursion • Recursively enumerable set • Decision problem • Church–Turing thesis • Computable function • Primitive recursive function •
Non-classical logic
Modal logic
Alethic • Axiologic • Deontic • Doxastic • Epistemic • Temporal
Intuitionism
Intuitionistic logic • Constructive analysis • Heyting arithmetic • Intuitionistic type theory • Constructive set theory •
Fuzzy logic
Degree of truth • Fuzzy rule • Fuzzy set • Fuzzy finite element • Fuzzy set operations •
Substructural logic
Structural rule • Relevance logic • Linear logic
Paraconsistent logic
Dialetheism
Logicians
Lists
Topics Outline of logic • Index of logic articles • Mathematical logic • Boolean algebra • Set theory
Other Logicians • Rules of inference • Paradoxes • Fallacies • Logic symbols
| 