|
|
|
||
Last update: T_KAM (20.04.2008)
|
|
||
Last update: prof. RNDr. Pavel Pudlák, DrSc. (01.10.2021)
The aim of the course is to teach students some parts of mathematical logic that are relevant for computer science. These are mainly topics from proof theory that have application in complexity theory, automated theorem proving, and other fields of theoretical computer science.
|
|
||
Last update: doc. Mgr. Jan Kynčl, Ph.D. (04.06.2019)
Oral exam. |
|
||
Last update: T_KAM (20.04.2008)
S. R. Buss, An introduction to proof theory, in: Handbook of Proof Theory, Elsevier 1988.
S.N. Burris, Logic for Mathematics and Computer Science, Prentice Hall, 1998.
C.-L. Chang, R. C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1970
J. Krajíček, Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and Its Applications, Vol. 60, Cambridge University Press, 1995.
P. Pudlák, The lengths of proofs, in: Handbook of Proof Theory, Elsevier 1988.
A.S. Troelstra and H. Schwichtenberg, Basic Proof Theory, Cambridge Univ. Press |
|
||
Last update: doc. Mgr. Jan Kynčl, Ph.D. (04.06.2019)
Oral exam. |
|
||
Last update: prof. RNDr. Pavel Pudlák, DrSc. (01.10.2021)
|