Economics Dictionary of ArgumentsHome
| |||
|
| |||
| 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. | |||
| Author | Concept | Summary/Quotes | Sources |
|---|---|---|---|
|
Logic Texts on Decidability - Dictionary of Arguments
Hoyningen-Huene II 227 Decidability/undecidability/decision problem: propositional logic: is decidable and complete. Predicate logic: undecidable. There is no mechanical method by which for any predicate-logical formula, the decision can be brought about whether it is universally valid or not. >Validity, >Proof._____________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. Translations: Dictionary of Arguments The note [Concept/Author], [Author1]Vs[Author2] or [Author]Vs[term] resp. "problem:"/"solution:", "old:"/"new:" and "thesis:" is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition. |
Logic Texts 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 Logic, Englewood Cliffs, New Jersey 1973 - German: Logik Stuttgart 1983 Sai V R.M.Sainsbury Paradoxes, Cambridge/New York/Melbourne 1995 - German: Paradoxien Stuttgart 2001 |
||
Authors A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Concepts A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
