Philosophy Lexicon of Arguments

Search  
 
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

 
Books on Amazon
I 146
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
I 232
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.

Mate I
B. Mates
Elementare Logik Göttingen 1969

Mate II
B. Mates
0226509869 1981


> Counter arguments against Mates



> Suggest your own contribution | > Suggest a correction | > Export as BibTeX Datei
 
Ed. Martin Schulz, access date 2017-05-25