Akten
Note on completeness and definability
Enthält: Kopie des Artikels "Note on completeness and definability" aus Technical Report 3 (27.1.1961) ( Applied Mathematics and Statistics Laboratories, Stanford University, Stanford Calif. 1961)
- Reference number
-
PAKN, GK Georg Kreisel, GK 8-1-48
- Extent
-
35 Bl.
- Context
-
Georg Kreisel >> Sonderdruck- und Schriftensammlung >> Sonderdrucksammlung Schriften
- Holding
-
PAKN, GK Georg Kreisel
- Date of creation
-
1961
- 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
- 1961
Other Objects (12)
A Note on Expressive Completeness of Modal Logic
Informal rigour and completeness proofs
On weak completeness of intuitionistic predicative logic
On weak completeness of intuitionistic predicate logic
On the concepts of Completeness and Interpretation of Formal Systems
Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
On stochastic completeness of weighted graphs
Graph algorithms and NP-completeness
A Remark on free choice sequences and the topological completeness proofs
Linear representability without completeness and transitivity
Randomness and completeness in computational complexity
Completeness and limitation of natural languages
A Note on Expressive Completeness of Modal Logic
Informal rigour and completeness proofs
On weak completeness of intuitionistic predicative logic
On weak completeness of intuitionistic predicate logic
On the concepts of Completeness and Interpretation of Formal Systems
Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
On stochastic completeness of weighted graphs
Graph algorithms and NP-completeness
A Remark on free choice sequences and the topological completeness proofs
Linear representability without completeness and transitivity
Randomness and completeness in computational complexity
Completeness and limitation of natural languages
A Note on Expressive Completeness of Modal Logic
Informal rigour and completeness proofs
On weak completeness of intuitionistic predicative logic
On weak completeness of intuitionistic predicate logic
On the concepts of Completeness and Interpretation of Formal Systems
Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
On stochastic completeness of weighted graphs
Graph algorithms and NP-completeness
A Remark on free choice sequences and the topological completeness proofs
Linear representability without completeness and transitivity
Randomness and completeness in computational complexity