|Decidability: a question, for example, whether a property applies to an object or not, is decidable if a result can be achieved within a finite time. For this decision process, an algorithm is chosen as a basis. See also halting problem, algorithms, procedures, decision theory._____________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. |
Books on Amazon
|Berka I 543ff
Undecidability/Gödel/Tarski: an undecidable statement is decidable in an enriched metascience ((s) metalanguage?).
E.g. I 543f -
Definability/Tarski: for every deductive science, which includes arithmetic,we can specify arithmetical terms that are not definable in it - I 545 - but with methods that are used here in analogy, you can show that these terms can be defined on the basis of the considered science when enriched by variables of a higher order._____________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.
Logic, Semantics, Metamathematics: Papers from 1923-38 Indianapolis 1983
K. Berka/L. Kreiser
Logik Texte Berlin 1983