{"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":25,"n_cols":5,"rows_kept":25,"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],[7,2,7,3],[8,2,8,3],[9,2,9,3],[18,2,18,3],[19,2,19,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466091903316"]
[null,null,"Autore",null,"Paulson Lawrence C"]
[null,null,"Titolo",null,"Isabelle [[electronic resource] ] : A Generic Theorem Prover / / by Lawrence C. Paulson"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994"]
[null,null,"ISBN",null,"3-540-48586-4"]
[null,null,"Edizione",null,"[1st ed. 1994.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIX, 329 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 828"]
[null,null,"Disciplina",null,"511.3/0285/53"]
[null,null,"Soggetti",null,"Mathematical logic"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$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,"Nota di contenuto",null,"Foundations -- Getting started with Isabelle -- Advanced methods -- Basic use of Isabelle -- Proof management: The subgoal module -- Tactics -- Tacticals -- Theorems and forward proof -- Theories, terms and types -- Defining logics -- Syntax transformations -- Substitution tactics -- Simplification -- The classical reasoner -- Basic concepts -- First-order logic -- Zermelo-Fraenkel set theory -- Higher-order logic -- First-order sequent calculus -- Constructive Type Theory -- Syntax of Isabelle Theories."]
[null,null,null,"Sommario/riassunto","As a generic theorem prover, Isabelle supports a variety of logics. Distinctive features include Isabelle's representation of logics within a meta-logic and the use of higher-order unification to combine inference rules. Isabelle can be applied to reasoning in pure mathematics or verification of computer systems. This volume constitutes the Isabelle documentation. It begins by outlining theoretical aspects and then demonstrates the use in practice. Virtually all Isabelle functions are described, with advice on correct usage and "]
[{"$nulls":4},"numerous examples. Isabelle's built-in logics are also described in detail. There is a comprehensive bebliography and index. The book addresses prospective users of Isabelle as well as researchers in logic and automated reasoning."]