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
- Reference number
-
PAKN, GK Georg Kreisel, GK 8-1-65
- Extent
-
2 Sonderdrucke
- Context
-
Georg Kreisel >> Sonderdruck- und Schriftensammlung >> Sonderdrucksammlung Schriften
- Holding
-
PAKN, GK Georg Kreisel
- Date of creation
-
1967
- Other object pages
- Last update
-
10.06.2025, 11:28 AM CEST
Data provider
This object is provided by:
Archive der Universität Konstanz. If you have any questions about the object, please contact the data provider.
Archive der Universität Konstanz. If you have any questions about the object, please contact the data provider.
Object type
- Sachakte
Time of origin
- 1967
Other Objects (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