Categories
1 results found in 31 ms.
Page 1 of 1
|
Published by: Massachusetts Institute of Technology | Language: English
Published by: Massachusetts Institute of Technology | Language: English
Share in:
This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can re
Author(s):
Tag(s):
- linguistics and philosophy
- logic
- theory of computability
- kurt g?del
- theorem
- system
- true
- arithmetical
- statements
- axiomatic basis
- proving
- truths of arithmetic
- history applications
- technique
- church?s theorem
- algorithm
- formula
- valid
- predicate calculus
- tarski?s theorem
- g?del?s second incompleteness theorem.
Similar courses
-
Description:This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can re
-
Description:This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can re
-
Description:This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can re
1 results found.
Page 1 of 1