On reasoning expressions and the nature of deduction rules (Q1262861)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On reasoning expressions and the nature of deduction rules |
scientific article; zbMATH DE number 4125399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On reasoning expressions and the nature of deduction rules |
scientific article; zbMATH DE number 4125399 |
Statements
On reasoning expressions and the nature of deduction rules (English)
0 references
1990
0 references
Reasoning expressions are those which express the reasoning procedure only by means of deduction rules and initial formulas (axioms or assumptions) without the help of any intermediate results in successive steps. They express the procedure systematically and concisely just like an algebraic form expressing a computing procedure. The deduction rules are mappings from formulas (premises) to a formula (conclusion). The elementary deduction rules are certain propositional connectives (but not necessarily truth functions), while the higher rules are certain binding operators (quantifiers etc.). Besides, the detachment rule is an inverse of the connective ``implication'', and is itself the kernel of the deduction method; while the suggestion rule (another inverse of ``implication'') is the kernel of induction method.
0 references
reasoning procedure
0 references
deduction rules
0 references
induction method
0 references
0.88420355
0 references
0.87918484
0 references
0.87857425
0 references
0.8779298
0 references
0 references
0.87451965
0 references
0.8718911
0 references