Pavel Pudlák.Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction. Springer Monographs in Mathematics. Springer, 2013. ISBN: 978-3-319-00118-0 (hbk); 978-3-319-00119-7 (ebook). Pp. xiv + 695

DOI10.1093/philmat/nkv006zbMath1358.00085OpenAlexW2038534342MaRDI QIDQ2965634

Alasdair Urquhart

Publication date: 3 March 2017

Published in: Philosophia Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/philmat/nkv006

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Complexity of computation (including implicit computational complexity) (03D15) Consistency and independence results (03E35) First-order arithmetic and fragments (03F30) Axiomatics of classical set theory and its fragments (03E30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof theory in general (including proof-theoretic semantics) (03F03) Complexity of proofs (03F20) External book reviews (00A17) Gödel numberings and issues of incompleteness (03F40)

Related Items (1)

A Logical Autobiography

This page was built for publication: Pavel Pudlák.Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction. Springer Monographs in Mathematics. Springer, 2013. ISBN: 978-3-319-00118-0 (hbk); 978-3-319-00119-7 (ebook). Pp. xiv + 695