Description: Lectures on Semantics: The Initial Algebra and Final Coalgebra Perspectives.- to Gröbner Bases.- Bounded Arithmetic and Propositional Proof Complexity.- The Structure of Nuprl's Type Theory.- Axiomatisations, Proofs, and Formal Specifications of Algorithms: Commented Case Studies in the Coq Proof Assistant.- Some Proof Theory of First Order Logic Programming.- Timed Rewriting Logic for the Specification of Time-Sensitive Systems.- Logic Programming and Meta-Logic.- Proofs, Lambda Terms and Control Operators.- Basic Proof Theory with Applications to Computation.
