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/NKV006MaRDI QIDQ2965634zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(3)

• A Logical Autobiography
• Book review of: A. Platzer, Logical foundations of cyber-physical systems
• Book review of: Oded Goldreich, Computational complexity: a conceptual perspective

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965634)