Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Gödel's Theorems and Incompletness - ALG119007

Title:	Neúplnost a Gödelovy věty
Form of teaching:	lecture+practicals
Guaranteed by:	Department of Logic (21-KLOG)
Faculty:	Faculty of Arts
Actual:	from 2025 to 2025
Duration in semesters:	1
Semester:	summer
Points:	0
E-Credits:	6
Examination process:	summer s.:
Hours per week, examination:	summer s.:2/2, Ex [HT]
Capacity:	unlimited / unlimited (unknown)
Maximum number of enrolled students:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
Key competences:
State of the course:	taught
Language:	Czech
Teaching methods:	full-time
Level:
Explanation:	Zoom: 963 3667 4794
Additional information:	http://www1.cuni.cz/~svejdar/?s=incompl
Repeated enrollment:	2 / 2 / 2 / 2
Note:	course can be enrolled in outside the study plan enabled for web enrollment

Guarantor:	doc. RNDr. Vítězslav Švejdar, CSc.
Teacher(s):	doc. RNDr. Vítězslav Švejdar, CSc.

SS schedule Noticeboard

Annotation -

Basic facts about RE sets, diagonalization.
Robinson arithmetic, Peano arithmetic and their properties. Formalization of logical syntax in Peano arithmetic. Self-reference. Gödel's incompleteness theorems. Rosser's theorem.
Modal logic GL (that is, provability logic).

Last update: Švejdar Vítězslav, doc. RNDr., CSc. (03.02.2026)

Course completion requirements - Czech

Ústní zkouška, která ověřuje zvládnutí pojmů a důkazů. Vlastní zkoušce předchází prodiskutování jednoho nebo několika cvičení z předem poskytnutého seznamu.

Last update: Švejdar Vítězslav, doc. RNDr., CSc. (03.02.2026)

Literature - Czech

V. Švejdar.Logika: neúplnost, složitost a nutnost. Academia, Praha, 2002

Last update: Švejdar Vítězslav, doc. RNDr., CSc. (03.02.2026)