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 |
|---|---|---|---|
|
Benson Mates on Decidability - Dictionary of Arguments
I 146 Decidability/tautologies/validity/Mates: for tautologies there a decision process (i.e. to decide whether something is a t.) - not for validity. >Tautologies, >Validity. Because for the validity truth wvalue tables are not sufficient. >Truth values, >Truth value tables. Even non-tautological statements can be valid. I 232 Decidability/decidable/Mates: a set of statements is decidable if there is a process that decides whether a particular statement is one of them or not - this method need not be known or practicable. >Decision theory, cf. >Proofs, >Provability._____________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. |
Mate I B. Mates Elementare Logik Göttingen 1969 Mate II B. Mates Skeptical Essays Chicago 1981 |
||
> Counter arguments against Mates
> Counter arguments in relation to Decidability
