Economics Dictionary of ArgumentsHome
| |||
|
| |||
| 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 | Concept | Summary/Quotes | Sources |
|---|---|---|---|
|
Alfred Tarski on Decidability - Dictionary of Arguments
Berka I 543ff Undecidability/Gödel/Tarski: an undecidable statement is decidable in an enriched metascience. Cf. >Metalanguage, >Expressivity, >Semantic closure. Definability/Tarski: for every deductive science, which includes arithmetic,we can specify arithmetical terms that are not definable in it. Cf. >Ideology/Quine, >Ontology/Quine. I 545 But with methods that are used here in analogy, you can show that these terms can be defined on the basis of the considered science when enriched by variables of a higher order.(1) 1. A.Tarski, Der Wahrheitsbegriff in den formalisierten Sprachen, Commentarii Societatis philosophicae Polonorum. Vol 1, Lemberg 1935_____________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. Translations: Dictionary of Arguments The note [Concept/Author], [Author1]Vs[Author2] or [Author]Vs[term] resp. "problem:"/"solution:", "old:"/"new:" and "thesis:" is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition. |
Tarski I A. Tarski Logic, Semantics, Metamathematics: Papers from 1923-38 Indianapolis 1983 Berka I Karel Berka Lothar Kreiser Logik Texte Berlin 1983 |
||
> Counter arguments against Tarski
> Counter arguments in relation to Decidability
