This week we discuss the completeness theorem for the propositional calculus. Details can be found in this handout. You should also read Lemmon Chapter 4 during the next two weeks.

We attempt to define the classical propositional logic by use of appropriate derivability conditions called Cn-definitions. The conditions characterize basic properties of propositional connectives.

A (normal) system of propositional modal logic is said to be complete iff it is characterized by a class of (Kripke) frames. When we move to modal predicate logic the question of completeness can ...

This course is compulsory on the BSc in Philosophy and Economics, BSc in Philosophy, Logic and Scientific Method, BSc in Philosophy, Politics and Economics and BSc in Politics and Philosophy. This ...

This course is available on the MPhil/PhD in Philosophy of the Social Sciences, MSc in Economics and Philosophy, MSc in Philosophy of Science and MSc in Philosophy of the Social Sciences. This course ...

when thinking about logical agents, we imagine that the agent has a knowledge base (KB for short) that contains logical sentences that describe the state of the world you could think of a KB as a ...

Due: Assignment #4 (Lemmon p. 62, #2 (all), #5 (omit i,j,k,l), #7; p. 73, #1 (part one, omit j,k); #3 (part one).) Reading: Lemmon Section 3.3 [Also read Sections 3.1 & 3.2 if you have not already.] ...