We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as ...

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.

This is a preview. Log in through your library . Abstract We construct an extension $\scr{L}^{P}$ of the standard language $\scr{L}$ of classical propositional logic by adjoining to the alphabet of ...

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 ...

This course is available on the MSc in Philosophy of Economics and the Social Sciences and MSc in Philosophy of Science. This course is freely available as an outside option to students on other ...

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.] ...