## 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._____________ 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 | More concepts for author | |
---|---|---|---|

Chaitin, G. | Decidability | Chaitin, G. | |

Cresswell, M.J. | Decidability | Cresswell, M.J. | |

Dummett, Michael | Decidability | Dummett, Michael | |

Field, Hartry | Decidability | Field, Hartry | |

Genz, H. | Decidability | Genz, H. | |

Hilbert, D. | Decidability | Hilbert, D. | |

Hintikka, J. | Decidability | Hintikka, J. | |

Leibniz, G.W. | Decidability | Leibniz, G.W. | |

Logic Texts | Decidability | Logic Texts | |

Lorenzen, Paul | Decidability | Lorenzen, Paul | |

Mates, B. | Decidability | Mates, B. | |

Quine, Willard Van Orman | Decidability | Quine, Willard Van Orman | |

Tarski, A. | Decidability | Tarski, A. | |

Ed. Martin Schulz, access date 2017-09-26 |