## Philosophy Lexicon of Arguments | |||

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. | |||

Author | Item | Excerpt | Meta data |
---|---|---|---|

Logic Texts Books on Amazon |
Decidability | 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. |
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 Logik Stuttgart 1983 Sai V R.M.Sainsbury Paradoxien Stuttgart 2001 |

back to list view | > Suggest your own contribution | > Suggest a correction

Ed. Martin Schulz, access date 2017-03-24