## Philosophy Lexicon of Arguments | |||

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

Field, Hartry Books on Amazon |
Decidability | II 343 Decidability / finiteness / Mathematics / Field: the operator F ("only a finite number") makes undecidable propositions in a finite range decidable - regardless of specific finiteness we have no specific term anamyore of e.g. a sentence of a given language, e.g. a theorem of a given system, e.g. a formula of a given language, e.g. the consistency of a system - because since Frege all evidence must be formalized. |
Fie I H. Field Realism, Mathematics and Modality Oxford New York 1989 Fie II H. Field Truth and the Absence of Fact Oxford New York 2001 Fie III H. Field Science without numbers Princeton New Jersey 1980 |

> Counter arguments against **Field**

> Suggest your own contribution | > Suggest a correction | > Export as BibTeX file

Ed. Martin Schulz, access date 2017-04-27