Logical foundations of mathematics and computational complexity : a gentle introduction / Pavel Pudlák

• Autore: Pudlák, Pavel
• Pubblicazione: Cham, : Springer, 2013
• Descrizione fisica: xiv, 695 p. : ill. ; 24 cm
• Soggetto topico: 03D15 - Complexity of computation [MSC 2020]; 03E30 - Axiomatics of classical set theory and its fragments [MSC 2020]; 03E35 - Consistency and independence results [MSC 2020]; 03F03 - Proof theory, general (including proof-theoretic semantics) [MSC 2020]; 03F20 - Complexity of proofs [MSC 2020]; 03F30 - First-order arithmetic and fragments [MSC 2020]; 03F40 - Gödel numberings and issues of incompleteness [MSC 2020]; 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020]
• Soggetto non controllato: Algorithm analysis and problem complexity; Algorithmic complexity; Complexity of Proofs; Computational complexity; Foundations of mathematics; Incompleteness theorems; Mathematical logic; Set-Theoretical Foundations
• Titolo autorizzato: Logical Foundations of Mathematics and Computational Complexity
• ISBN: 978-33-19-00118-0
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: VAN00273604
• Lo trovi qui: Univ. Vanvitelli
• Localizzazioni e accesso elettronico: /sebina/repository/catalogazione/documenti/Logical foundations of mathematics and computational complexity.pdf
• Serie: Springer monographs in mathematics Berlin [etc.] . -Springer , 1989-