This is a first version of a lecture on propositional and predicate logic. The lecture notes are incomplete as of yet, but the goal is to add notes for one lecture every week. As the book is a work in ...

In this lecture we exploit logic programming in order to write a theorem prover for propositional logic. A straightforward specification using the logical rules is sound, but will in general not ...

In this lecture we complete our discussion of Dyckhoff's contraction free sequent calculus and the decision procedure for intuitionistic propositional logic it generates. We then discuss how to define ...

In Lecture 4 we introduced a few new propositions about programs. One proposition $(v, c) \rightarrow^* (v', c')$ was about reachability; if true, this proposition means that the program can reach ...

Welcome to CS221! This repository contains all the (executable) lectures, which are made using edtrace. Each lecture consists of stepping through Python files which you can either view in your browser ...

The present article shows that there are consistent and decidable many- valued systems of propositional logic which satisfy two or all the three criteria for non- trivial inconsistent theories by da ...