{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":17,"n_cols":5,"rows_kept":17,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[14,2,14,3],[15,2,15,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNICAMPANIAVAN00273604"]
[null,null,"Autore",null,"Pudlák, Pavel"]
[null,null,"Titolo",null,"Logical foundations of mathematics and computational complexity : a gentle introduction / Pavel  Pudlák"]
[null,null,"Pubbl/distr/stampa",null,"Cham, : Springer, 2013"]
[null,null,"ISBN",null,"978-33-19-00118-0"]
[null,null,"Descrizione fisica",null,"xiv, 695 p. : ill. ; 24 cm"]
[null,null,"Soggetti",null,"03D15 - Complexity of computation [MSC 2020]"]
[{"$nulls":4},"03E30 - Axiomatics of classical set theory and its fragments [MSC 2020]"]
[{"$nulls":4},"03E35 - Consistency and independence results [MSC 2020]"]
[{"$nulls":4},"03F03 - Proof theory, general (including proof-theoretic semantics) [MSC 2020]"]
[{"$nulls":4},"03F20 - Complexity of proofs [MSC 2020]"]
[{"$nulls":4},"03F30 - First-order arithmetic and fragments [MSC 2020]"]
[{"$nulls":4},"03F40 - Gödel numberings and issues of incompleteness [MSC 2020]"]
[{"$nulls":4},"68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020]"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]