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

Lorenzen, Paul Books on Amazon |
Decidability | P. Lorenzen Ein dialogisches Konstruktivitätskriterium (1959) in Karel Berka/L. Kreiser Logik Texte Berlin, 1983 Berka I 267 Decision problem/recursion/recursiveness/dialogical logic/Lorenzen: if R(x, y) is a decision-definite statement form, (Ex) R(x,y) no longer needs to be decision-definite. Nevertheless, on the other hand, the assertion of such statements as (1) (Ex) R(x,n) does not need to trigger a senseless dispute! It is obvious, then, to agree that the person who claims (1) is also obliged to give a number m, so that (2) R (m, n) is true. If he cannot do this, he has "lost" his claim. |
Lorn I P. Lorenzen Constructive Philosophy Cambridge 1987 Brk I K. Berka/L. Kreiser Logik Texte Berlin 1983 |

> Counter arguments against **Lorenzen**

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

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