Marek, J. Halmosz "Naive set theory". Additional information registration calendar, class conductors, localization and schedules of classes , might be available in the USOSweb system:. ECTS credits: 6 or 4.
|Published (Last):||28 May 2004|
|PDF File Size:||8.57 Mb|
|ePub File Size:||11.3 Mb|
|Price:||Free* [*Free Regsitration Required]|
Marek, J. Halmosz "Naive set theory". Additional information registration calendar, class conductors, localization and schedules of classes , might be available in the USOSweb system:. ECTS credits: 6 or 4. Organized by: Faculty of Mathematics and Computer Science.
After the course: 1. Student uses truth tables and distinguishes true from false sentences, applies logic rules to set theory. Student uses basic quantificational logic. Student recognizes statements, arguments and proof. Student recognizes equivalence and ordering relations, constructs equivalence relation classes. Student uses the notion of function, image, inverse image, one to one function. Student applies mathematical induction.
Student recognizes cardinal numbers. Attendance at lectures is obligatory. Algebra of sentences. The logical laws. Algebra of sets. The algebra sets laws. The quantifiers: the quantifiers laws. Relations and fuctions 5. The indexing family of sets. Equivalence relations. The abstract rule. Mathematical induction. The recurrence definitions. Infinite sets. The numbers alef zero, continuum. You are not logged in log in.
Elements of Computability Theory and Metamathematics
We'd like to understand how you use our websites in order to improve them. Register your interest. This note gives a brief personal account of my early interactions with Victor Marek. These interactions are important to me as they clearly had significant influence on my career but, more to the point here, they shed light on Victor and how he does science. This is a preview of subscription content, log in to check access. Rent this article via DeepDyve.
Discrete Mathematics 3