Girard introduced phase semantics as a complete set-theoretic semantics of linear logic, and Okada modified phase-semantic completeness proofs to obtain normalform theorems. On the basis of these ...

We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of ...

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.