Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have ...

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.

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

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

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