Subjects

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

Mathematical Logic - NMAG331

Title:	Matematická logika
Guaranteed by:	Department of Algebra (32-KA)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2016 to 2016
Semester:	winter
E-Credits:	3
Hours per week, examination:	winter s.:2/0, Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech, English
Teaching methods:	full-time
Teaching methods:	full-time

Guarantor:	doc. RNDr. David Stanovský, Ph.D.
Class:	M Mgr. MSTR > Povinně volitelné
Classification:	Informatics > Discrete Mathematics Mathematics > Discrete Mathematics
Incompatibility :	NLTM006
Interchangeability :	NLTM006
Is interchangeable with:	NLTM006
In complex pre-requisite:	NMAG349

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (05.09.2013)

An advanced course in mathematical logic. It breifly recalls basic concepts and costructions. The main topic is the incompleteness and the undecidability, and Godel's theorems in particular. A recommended course for specializations Mathematical Analysis and Mathematical Structures within General Mathematics.

Aim of the course - Czech

Last update: doc. RNDr. David Stanovský, Ph.D. (25.09.2018)

Cílem je vyložit matematickou analýzu problému logických základů matematiky.

Literature -

Last update: doc. RNDr. David Stanovský, Ph.D. (25.09.2018)

J.R.Shoenfield: Mathematical logic; Addison-Wesley Publishing Company, London . Don Mills, Ontario, 1967.

Syllabus -

Last update: prof. RNDr. Jan Krajíček, DrSc. (14.07.2019)

A review of basics of first-order logic, including elements of model theory. Peano arithmetic PA, formalization of syntax in PA. Godel's theorems. Turing machines, the universal machine, the undecidability of the halting problem.