|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. |
Decidability / tautologies / validity / Mates: for tautologies there a decision process (i.e. to decide whether something is a t.) - not for validity - because for the validity truth wvalue tables are not sufficient - even non-tautological statements can be valid
Decidability / decidable / Mates: is a set of statements 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._____________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. The note [Author1]Vs[Author2] or [Author]Vs[term] is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition.
Elementare Logik Göttingen 1969
Skeptical Essays Chicago 1981