Logical Foundations of Mathematics and Computational Complexity A Gentle Introduction /
The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Foundations of Mathematics and Computational Complexity covers a broad spectrum of results in logic and set theory that are relevant to the fou...
Κύριος συγγραφέας: | Pudlák, Pavel (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Heidelberg :
Springer International Publishing : Imprint: Springer,
2013.
|
Σειρά: | Springer Monographs in Mathematics,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Computational Complexity of Solving Equation Systems
ανά: Broniek, Przemysław
Έκδοση: (2015) -
Theory and Applications of Satisfiability Testing 6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers /
Έκδοση: (2004) -
DNA Computing 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 1-3, 2003. Revised Papers /
Έκδοση: (2004) -
Logical Foundations of Computer Science International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings /
Έκδοση: (2009) -
Lectures on Concurrency and Petri Nets Advances in Petri Nets /
Έκδοση: (2004)