|
|
|
|
LEADER |
00000cam a2200000Mi 4500 |
001 |
EBOOKCENTRAL_ocn849285886 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr nn|008mamaa |
008 |
130423s2013 gw o 000 0 eng d |
040 |
|
|
|a A7U
|b eng
|e pn
|c A7U
|d OCLCO
|d MHW
|d DEBSZ
|d OCLCQ
|d OCLCF
|d OCLCQ
|d VT2
|d REB
|d WYU
|d LEAUB
|d OCLCQ
|d DCT
|d ERF
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 1026431840
|a 1066537819
|a 1086513613
|a 1110922228
|a 1112524577
|
020 |
|
|
|a 9783319001197
|
020 |
|
|
|a 3319001191
|
024 |
7 |
|
|a 10.1007/978-3-319-00119-7
|2 doi
|
029 |
1 |
|
|a CHNEW
|b 001083084
|
029 |
1 |
|
|a DEBSZ
|b 397552831
|
029 |
1 |
|
|a DEBSZ
|b 431429812
|
035 |
|
|
|a (OCoLC)849285886
|z (OCoLC)1026431840
|z (OCoLC)1066537819
|z (OCoLC)1086513613
|z (OCoLC)1110922228
|z (OCoLC)1112524577
|
037 |
|
|
|b Springer
|
050 |
|
4 |
|a QA9
|
072 |
|
7 |
|a PBC
|2 bicssc
|
072 |
|
7 |
|a PBCD
|2 bicssc
|
072 |
|
7 |
|a MAT018000
|2 bisacsh
|
082 |
0 |
4 |
|a 511.3
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Pudlák, Pavel.
|
245 |
1 |
0 |
|a Logical Foundations of Mathematics and Computational Complexity :
|b a Gentle Introduction /
|c by Pavel Pudlák.
|
260 |
|
|
|a Heidelberg :
|b Springer International Publishing :
|b Imprint :
|b Springer,
|c 2013.
|
300 |
|
|
|a 1 online resource (XIV, 695 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|
347 |
|
|
|b PDF
|
490 |
1 |
|
|a Springer Monographs in Mathematics,
|x 1439-7382
|
520 |
|
|
|a 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 foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as im.
|
505 |
0 |
|
|a Mathematician's world -- Language, logic and computations -- Set theory -- Proofs of impossibility -- The complexity of computations -- Proof complexity -- Consistency, Truth and Existence -- References.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Mathematics.
|
650 |
|
0 |
|a Computer software.
|
650 |
|
0 |
|a Logic, Symbolic and mathematical.
|
650 |
|
2 |
|a Mathematics
|
650 |
|
2 |
|a Software
|
650 |
|
6 |
|a Mathématiques.
|
650 |
|
6 |
|a Logiciels.
|
650 |
|
6 |
|a Logique symbolique et mathématique.
|
650 |
|
7 |
|a software.
|2 aat
|
650 |
|
7 |
|a Computer software
|2 fast
|
650 |
|
7 |
|a Logic, Symbolic and mathematical
|2 fast
|
650 |
|
7 |
|a Mathematics
|2 fast
|
758 |
|
|
|i has work:
|a Logical foundations of mathematics and computational complexity (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGg8M8TjmxBqrjbgykhXHP
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319001180
|
830 |
|
0 |
|a Springer monographs in mathematics,
|x 1439-7382
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1205643
|z Texto completo
|
994 |
|
|
|a 92
|b IZTAP
|