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 |
---|---|---|---|
Maxwell J. Cresswell on Decidability - Dictionary of Arguments
I HC 120 Decidability/propositional calculus/Hughes/Cresswell: although it is possible to give a clear view of the validity of the propositional calculus, the propositional calculus is still not a decidable system. - But there are a number of decidable fragments of the propositional calculus. The same goes for the modal expansion of the propositional calculus. >Predicate calculus, >Expansion, >Validity, >Systems._____________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. |
Cr I M. J. Cresswell Semantical Essays (Possible worlds and their rivals) Dordrecht Boston 1988 Cr II M. J. Cresswell Structured Meanings Cambridge Mass. 1984 |