Philosophy Dictionary of ArgumentsHome
| |||
|
| |||
| Proofs: A proof in logic, mathematics is a finite string of symbols, which derives a statement in a system from the axioms of the system together with already proven statements. See also Proof theory, Provability, Syntax, Axioms._____________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 Proofs - Dictionary of Arguments
Berka I 406 Infinity/proof/Tarski: Solution: provability instead of actual evidence.(1) ((s) Proofs must be finite strings.) >Proof theory, >Syntax. 1. A.Tarski, „Über den Begriff der logischen Folgerung“, in: Actes du Congrès International de Philosophie Scientifique, Paris 1935, Bd. VII, ASI 394, Paris 1936, pp 1-11_____________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 |
||
Ed. Martin Schulz, access date 2024-04-25