|Derivability: question which statements can be obtained according to the rules of a calculus._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. |
|Thiel I 97
Derivability/Hilbert/Thiel: The methods used for the proof of the non-derivability of a formula from others by means of given derivation rules have been given for the first time by Bernays in the Hilbert school. Bernays postdoctoral thesis for the proof of the independence of axiom systems of classical propositional logic. Neither of these axioms is to be derived from the others.
Classic: ~~p > p
effective: p > ~~p ....+...I 98 102
Axiomatic derivations of logical sentences were unrivaled up to the twenties in this form, then alternative procedure calculus of the "natural concluding" were developed, whose rule usually bring exactly one logical symbol into a conclusion chain or eliminate. The actual kind of mathematical approach is closer than the axiomatic approach._____________Explanation of symbols: Roman numerals indicate the source, arabic numerals indicate the page number. The corresponding books are indicated on the right hand side. ((s)…): Comment by the sender of the contribution. The note [Author1]Vs[Author2] or [Author]Vs[term] is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition.
Philosophie und Mathematik Darmstadt 1995