Our Phoenix Support Center phone lines will be down on Friday at 4pm PST until 6PM PST on Sunday May 18th for system maintenance! However, our emergency lines remain open for any health and safety emergency. Thank you in advance for your patience!
Claim up to $1,250 in flight credits!
Get up to $1,250 in flight credits or grants toward study or internship programs abroad when you apply by June 30, 2025. See our Official Rules for full details.
CEA CAPA Partner Institution: Vrije Universiteit Amsterdam
Location: Amsterdam, Netherlands
Primary Subject Area: Computer Sciences
Instruction in: English
Course Code: X_401015
Transcript Source: Partner Institution
Course Details: Level 200
Recommended Semester Credits: 3
Contact Hours: 84
DESCRIPTION
The focus of the lecture is on propositional logic and first-order predicate logic. We work with natural deduction as proof system. The relation between semantic and syntactic methods is important; the central keywords are correctness, consistency and completeness. Moreover, we pay attention to expressive power, for example when formulating queries. A fundamental tool, for this purpose, is the compactness theorem. Algorithmically there the contrast between the decidability of propositional logic and the undecidability of predicate logic (for example, seen by a coding of the Post Correspondence Problem). As a variation of the mentioned logics, we consider modal logic with Kripke models as semantics.
Vrije Universiteit Amsterdam (VU Amsterdam) awards credits based on the ECTS system. Contact hours listed under a course description may vary due to the combination of lecture-based and independent work required for each course therefore, CEA's recommended credits are based on the ECTS credits assigned by VU Amsterdam. 1 ECTS equals 28 contact hours assigned by VU Amsterdam.
Get a Flight Credit worth up to $1,250 when you apply with code* by June 30, 2025