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.

_____________
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 Item Excerpt Meta data

 
Books on Amazon
EMD II 103
Undecidability/anti-realism / Dummett: (without bivalence), meaning theory will then be no longer purely descriptive in relation to our actual practice.

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

Du I
M. Dummett
Ursprünge der analytischen Philosophie Frankfurt 1992

Du III
M. Dummett
Wahrheit Stuttgart 1982

EMD II
G. Evans/J. McDowell
Truth and Meaning Oxford 1977

Ev I
G. Evans
The Varieties of Reference (Clarendon Paperbacks) Oxford 1989


> Counter arguments against Dummett



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