Philosophy Lexicon of Arguments

Screenshot Tabelle Begriffe

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 Summary Meta data

Books on Amazon

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.

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.

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

H. Field
Science without numbers Princeton New Jersey 1980

Send Link
> Counter arguments against Field

Authors A   B   C   D   E   F   G   H   I   J   K   L   M   N   P   Q   R   S   T   U   V   W   Z  

Concepts A   B   C   D   E   F   G   H   I   J   K   L   M   N   O   P   Q   R   S   T   U   V   W   Z  

> Suggest your own contribution | > Suggest a correction | > Export as BibTeX Datei
Ed. Martin Schulz, access date 2018-03-17