Pudlák. Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction
Presents a wide range of results in logic and computational complexity.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Volume 1: Logical Foundations softwarefoundations.cis.upenn.edu
Introduction to functional programming, basic concepts of logic, and computer-assisted theorem proving.
-
Introduction to Logic logic.stanford.edu
Michael Genesereth, Eric J. Kao (Stanford University).
-
Krantz. Handbook of Logic and Proof Techniques for Computer Science maa.org
A concise offered as an accessible reference on mathematical logic for the professional computer scientist.
-
Lacona. LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science link.springer.com
Suitable for undergraduate introductions to logic and early graduate courses on logic.
-
Demaine. Algorithmic Lower Bounds: Fun with Hardness Proofs ocw.mit.edu
A class taking a practical approach to proving problems can't be solved efficient.
-
Rudich & Wigderson. Computational Complexity Theory ams.org
Three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. Topics include reductions, lower-bounds, average-case complexity, randomness, interactive proof systems, probabilistically checkable proofs, quantum computing, and…
Theoretical Computer Science › Computational Complexity > Books: “Presents a wide range of results in logic and computational complexity.”