{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":34,"n_cols":5,"rows_kept":34,"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],[3,2,3,3],[4,2,4,3],[6,2,6,3],[14,2,14,3],[15,2,15,3],[19,2,19,3],[19,4,19,5],[20,2,20,3],[20,4,20,5],[21,2,21,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3],[33,2,33,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910716213503321"]
[null,null,"Titolo",null,"Bridge across the Mississippi River at or near the City of Natchez, Miss. April 19 (calendar day, April 20), 1926. -- Ordered to be printed"]
[null,null,"Pubbl/distr/stampa",null,"[Washington, D.C.] : , : [U.S. Government Printing Office], , 1926"]
[null,null,"Descrizione fisica",null,"1 online resource (2 pages)"]
[null,null,"Collana",null,"Senate report / 69th Congress, 1st session. Senate ; ; no. 636"]
[{"$nulls":4},"[United States congressional serial set ] ; ; [serial no. 8525]"]
[null,null,"Soggetti",null,"Bridge construction industry"]
[{"$nulls":4},"Bridges - Design and construction"]
[{"$nulls":4},"Bridges"]
[{"$nulls":4},"Construction industry"]
[{"$nulls":4},"Eminent domain"]
[{"$nulls":4},"Legislative amendments"]
[{"$nulls":4},"Toll bridges"]
[{"$nulls":4},"Legislative materials."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Batch processed record: Metadata reviewed, not verified. Some fields updated by batch processes."]
[{"$nulls":4},"FDLP item number not assigned."]
[null,"2.","Record Nr.",null,"UNINA9910826115703321"]
[null,null,"Titolo",null,"Logic and computation : proceedings of a workshop held at Carnegie Mellon University, June 30-July 2, 1987 / / Wilfried Sieg, editor"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , [1990]"]
[{"$nulls":4},"©1990"]
[null,null,"ISBN",null,"0-8218-7694-5"]
[null,null,"Descrizione fisica",null,"1 online resource (314 p.)"]
[null,null,"Collana",null,"Contemporary mathematics, , 0271-4132 ; ; 106"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Computable functions - Data processing"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"The Workshop on Logic and Computation was held at Carnegie Mellon University on June 30-July 2, 1987\"--T.p. verso."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Contents --  Preface --  Some theories conservative over intuitionistic arithmetic --  Ramsey interpreted: A parametric version of Ramsey's theorem --  Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic --  A note on polynomial time computable arithmetic --  Axiomatizations and conservation results for fragments of bounded arithmetic --  A smash-based hierarchy between PTIME and PSPACE --  Polymorphic typed lambda-calculi in a type-free axiomatic framework --  Polynomial time computable arithmetic --  Metaprogramming in SIL --  W K Lo and orderings of countable abelian groups --  Marriage theorems and reverse mathematics --  Computationally based set existence principles --  Hierarchy results for mixed-time --  Polynomial time equivalence types --  Program development through proof transformation --  Some models of Scott's theory LC F based on a notion of rate of convergence --  Sharply bounded arithmetic and the function a -1 --  Radon-nikodym theorem is equivalent to arithmetical comprehension."]