{"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":24,"n_cols":5,"rows_kept":24,"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[17,2,17,3],[18,2,18,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465789103316"]
[null,null,"Titolo",null,"Computer Science Logic [[electronic resource] ] : 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings / / edited by Laurent Fribourg"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001"]
[null,null,"ISBN",null,"3-540-44802-0"]
[null,null,"Edizione",null,"[1st ed. 2001.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 628 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2142"]
[null,null,"Disciplina",null,"005.1/01/5113"]
[null,null,"Soggetti",null,"Programming languages (Electronic computers)"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Programming Languages, Compilers, Interpreters"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Mathematical Logic and Foundations"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Papers -- Local Reasoning about Programs that Alter Data Structures -- Applications of Alfred Tarski’s Ideas in Database Theory -- Locus Solum: From the Rules of Logic to the Logic of Rules -- Contributed Papers -- The Expressive Power of Horn Monadic Linear Logic -- Non-commutativity and MELL in the Calculus of Structures -- Quadratic Correctness Criterion for Non-commutative Logic -- Descriptive Complexity -- Capture Complexity by Partition -- An Existential Locality Theorem -- Actual Arithmetic and Feasibility -- The Natural Order-Generic Collapse for ?-Representable Databases over the Rational and the Real Ordered Group -- Semantics -- An Algebraic Foundation for Higraphs -- Semantic Characterisations of Second-Order Computability over the Real Numbers -- An Abstract Look at Realizability -- The Anatomy of Innocence -- Higher-Order Programs -- An Improved Extensionality Criterion for Higher-Order Logic Programs -- A Logic for Abstract State Machines -- Constrained Hyper "]
[{"$nulls":4},"Tableaux -- Modal Logics -- Modal Logic and the Two-Variable Fragment -- A Logic for Approximate First-Order Reasoning -- Inflationary Fixed Points in Modal Logic -- Categorical and Kripke Semantics for Constructive S4 Modal Logic -- Verification -- Labelled Natural Deduction for Interval Logics -- Decidable Navigation Logics for Object Structures -- The Decidability of Model Checking Mobile Ambients -- Automata -- A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem -- An Effective Extension of the Wagner Hierarchy to Blind Counter Automata -- Decision Procedure for an Extension of WS1S -- Lambda-Calculus -- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic -- Intersection Logic -- Life without the Terminal Type -- Fully Complete Minimal PER Models for the Simply Typed ?-Calculus -- Induction -- A Principle of Induction -- On a Generalisation of Herbrand’s Theorem -- Well-Founded Recursive Relations -- Equational Calculus -- Stratified Context Unification Is in PSPACE -- Uniform Derivation of Decision Procedures by Superposition -- Complete Categorical Equational Deduction -- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories -- Constructive Theory of Types -- Normalized Types -- Markov’s Principle for Propositional Type Theory -- Recursion for Higher-Order Encodings -- Monotone Inductive and Coinductive Constructors of Rank 2."]