Akten
Informal rigour and completeness proofs
Enthält: 2 Sonderdrucke des Artikels "Informal rigour and completeness proofs" aus Problems in the Philosophy of Mathematics. Proccedings of the International Colloquium in the Philosophy of Science, Bd. I, hg. von Imre Lakatos, Amsterdam 1967
- Archivaliensignatur
-
PAKN, GK Georg Kreisel, GK 8-1-65
- Umfang
-
2 Sonderdrucke
- Kontext
-
Georg Kreisel >> Sonderdruck- und Schriftensammlung >> Sonderdrucksammlung Schriften
- Bestand
-
PAKN, GK Georg Kreisel
- Laufzeit
-
1967
- Weitere Objektseiten
- Letzte Aktualisierung
-
10.06.2025, 11:28 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Archive der Universität Konstanz. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Archive der Universität Konstanz. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Sachakte
Entstanden
- 1967
Ähnliche Objekte (12)
A Remark on free choice sequences and the topological completeness proofs
Note on completeness and definability
Proofs and Provability
Graph algorithms and NP-completeness
Proofs and "Puzzles"
Proofs and "Puzzles"
Linear representability without completeness and transitivity
Completeness and limitation of natural languages
Randomness and completeness in computational complexity
Completeness of Information Sources
Completeness of Information Sources
Completeness and reduction in algebraic complexity theory
A Remark on free choice sequences and the topological completeness proofs
Note on completeness and definability
Proofs and Provability
Graph algorithms and NP-completeness
Proofs and "Puzzles"
Proofs and "Puzzles"
Linear representability without completeness and transitivity
Completeness and limitation of natural languages
Randomness and completeness in computational complexity
Completeness of Information Sources
Completeness of Information Sources
Completeness and reduction in algebraic complexity theory
A Remark on free choice sequences and the topological completeness proofs
Note on completeness and definability
Proofs and Provability
Graph algorithms and NP-completeness
Proofs and "Puzzles"
Proofs and "Puzzles"
Linear representability without completeness and transitivity
Completeness and limitation of natural languages
Randomness and completeness in computational complexity
Completeness of Information Sources
Completeness of Information Sources