Difference between revisions of "Sound rule"
(TeX) |
(Category:Logic and foundations) |
||
Line 2: | Line 2: | ||
''admissible rule'' | ''admissible rule'' | ||
− | A [[ | + | A [[derivation rule]] the addition of which to a [[calculus]] does not alter the collection of derivable formulas in this calculus. The introduction of a sound rule into a calculus is a powerful and frequently used method for abbreviating proofs, and is often useful in improving the algorithms for the establishment of derivability. One of the most important results in mathematical logic is the theorem stating that the cut rule is sound (see [[Gentzen formal system]]). See [[Deducible rule]]; [[Derived rule]]. |
Line 10: | Line 10: | ||
====References==== | ====References==== | ||
− | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> R. Wojcicki, "Theory of logical calculi" , Kluwer (1988) pp. Chapt. 2</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top"> C. Smorinsky, "The incompleteness theorems" J. Barwise (ed.) , ''Handbook of mathematical logic'' , North-Holland (1977) pp. 821–865</TD></TR><TR><TD valign="top">[a3]</TD> <TD valign="top"> W. Hodges, "Elementary predicate logic" D. Gabbay (ed.) F. Guenther (ed.) , ''Handbook of philosophical logic'' , '''I''' , Reidel (1983) pp. 1–132</TD></TR></table> | + | <table> |
+ | <TR><TD valign="top">[a1]</TD> <TD valign="top"> R. Wojcicki, "Theory of logical calculi" , Kluwer (1988) pp. Chapt. 2</TD></TR> | ||
+ | <TR><TD valign="top">[a2]</TD> <TD valign="top"> C. Smorinsky, "The incompleteness theorems" J. Barwise (ed.) , ''Handbook of mathematical logic'' , North-Holland (1977) pp. 821–865</TD></TR> | ||
+ | <TR><TD valign="top">[a3]</TD> <TD valign="top"> W. Hodges, "Elementary predicate logic" D. Gabbay (ed.) F. Guenther (ed.) , ''Handbook of philosophical logic'' , '''I''' , Reidel (1983) pp. 1–132</TD></TR> | ||
+ | </table> | ||
+ | |||
+ | [[Category:Logic and foundations]] |
Latest revision as of 19:21, 17 October 2014
admissible rule
A derivation rule the addition of which to a calculus does not alter the collection of derivable formulas in this calculus. The introduction of a sound rule into a calculus is a powerful and frequently used method for abbreviating proofs, and is often useful in improving the algorithms for the establishment of derivability. One of the most important results in mathematical logic is the theorem stating that the cut rule is sound (see Gentzen formal system). See Deducible rule; Derived rule.
Comments
A (logical) theory is sound if everything provable in it is true, cf. [a2], [a3] for a discussion of the concept of a sound theory and related mathematical principles such as consistency, $\omega$-consistency, completeness and reflection principles.
References
[a1] | R. Wojcicki, "Theory of logical calculi" , Kluwer (1988) pp. Chapt. 2 |
[a2] | C. Smorinsky, "The incompleteness theorems" J. Barwise (ed.) , Handbook of mathematical logic , North-Holland (1977) pp. 821–865 |
[a3] | W. Hodges, "Elementary predicate logic" D. Gabbay (ed.) F. Guenther (ed.) , Handbook of philosophical logic , I , Reidel (1983) pp. 1–132 |
Sound rule. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Sound_rule&oldid=33738