|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. |
|Hoyningen-Huene II 227
Decidability / undecidability / decision problem. propositional logic: decidable and complete - predicate logic: undecidable - there is no mechanical method by which for any p.l. formula, the decision can be brought about if it is universally valid or not._____________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.
Me I Albert Menne Folgerichtig Denken Darmstadt 1988
HH II Hoyningen-Huene Formale Logik, Stuttgart 1998
Re III Stephen Read Philosophie der Logik Hamburg 1997
Sal IV Wesley C. Salmon Logik Stuttgart 1983
Sai V R.M.Sainsbury Paradoxien Stuttgart 2001