Theoretical Computer Science

Computational Logic

First-Order Logic

• [Completeness] (https://en.wikipedia.org/wiki/Completeness_(logic))
• [Gödel's completeness theorem] (https://en.wikipedia.org/wiki/G%C3%B6del's_completeness_theorem)
• [Horn clause] (https://en.wikipedia.org/wiki/Horn_clause)
• [SLD Resolution 1] (https://en.wikipedia.org/wiki/SLD_resolution)
• [SLD Resolution 2] (http://www.ale.cs.toronto.edu/docs/ref/ale_trale_ref/ale_trale_ref-node44.html)

Non-Monotonic Logic

• [Non-Monotonic Logic] (https://en.wikipedia.org/wiki/Non-monotonic_logic)

Computational Theory

notes

• Maheshwari, A. and Smid, M. (2016). Introduction to the Theory of Computation. School of Computer Science, Carleton University, Canada. Available online at http://cglab.ca/~michiel/TheoryOfComputation/TheoryOfComputation.pdf (Retrieved: 7 April, 2016).

lectures

• [Introduction to the Theory of Computation -- CoderIsland] (https://www.youtube.com/playlist?list=PL601FC994BDD963E4)
• [Theory of Computation -- NPTEL, Indian Institute of Technology] (https://www.youtube.com/playlist?list=PLbMVogVj5nJSd25WnSU144ZyGmsqjuKr3)
• [Theory of Computation -- University of California, Davis] (https://www.youtube.com/playlist?list=PLslgisHe5tBM8UTCt1f66oMkpmjCblzkt)

Programming languages

• [Programming Language Theory] (http://steshaw.org/plt/)