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
I HC 120
Decidability / Propositional calculus / Hughes / Cresswell: although it is possible to give a clear view of the validity of the p.c., the p.c. is still not a decidable system - but there are a number of decidable fragments of the p.c. - the same goes for the modal expansion of the p.c..

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

Cr I
M. J. Cresswell
Semantical Essays (Possible worlds and their rivals) Dordrecht Boston 1988

Cr II
M. J. Cresswell
Structured Meanings Cambridge Mass. 1984


> Counter arguments against Cresswell



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