01812nam2 2200409 i 450 MIL053648120231121125549.088870279009788884502773rist. 2007IT2002-15417 20020418d2000 ||||0itac50 baitaitz01i xxxe z01n˜3: Il œcanzoniere palatinoBiblioteca nazionale centrale di Firenze, Banco Rari 217, ex Palatino 418Ripr. fotograficaTavarnuzze, ImprunetaSISMEL Edizioni del Galluzzo2000XXXVIII, [176! p.30 cmBiblioteche e archivi6Nella pagina contro il front.: Comitato nazionale per le celebrazioni dell'8. centenario della nascita di Federico 2Ed. di 500 esempl. num.Tit. sul dorso: Palatino.CFI0539181001CFI03878422001 Biblioteche e archivi6001MIL05362702001 ˜I œcanzonieri della lirica italiana delle originia cura di Lino Leonardi3Palatino.CFI0539181FirenzeBiblioteca Nazionale CentraleManoscrittiPalatino 418FacsimiliFIRUFIC096433IITIT-0120020418IT-RM0290 IT-RM0151 IT-FR0017 BIBLIOTECA ANGELICARM0290 Biblioteca Istituto Storico Italiano Medio Evo - IRM0151 Biblioteca umanistica Giorgio ApreaFR0017 NMIL0536481Biblioteca umanistica Giorgio Aprea 52SALA BRAGAS.S.L. 333.6.3 52COB0000906005 VMB RS A 2016120720161207 06 41 52Canzoniere palatino983427UNICAS05684nam 22008175 450 991048386540332120251226195414.03-540-45459-410.1007/11874683(CKB)1000000000283780(SSID)ssj0000316900(PQKBManifestationID)11258553(PQKBTitleCode)TC0000316900(PQKBWorkID)10286687(PQKB)10404554(DE-He213)978-3-540-45459-5(MiAaPQ)EBC3068167(PPN)123138604(BIP)34164340(BIP)13637540(EXLCZ)99100000000028378020100323d2006 u| 0engurnn#008mamaatxtccrComputer Science Logic 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings /edited by Zoltán Ésik1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XII, 627 p.)Theoretical Computer Science and General Issues,2512-2029 ;4207Bibliographic Level Mode of Issuance: Monograph3-540-45458-6 Includes bibliographical references and index.Invited Presentations -- Functorial Boxes in String Diagrams -- Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract) -- Automata and Logics for Words and Trees over an Infinite Alphabet -- Nonmonotonic Logics and Their Algebraic Foundations -- Contributions -- Semi-continuous Sized Types and Termination -- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation -- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata -- The Power of Linear Functions -- Logical Omniscience Via Proof Complexity -- Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic -- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay -- Abstracting Allocation -- Collapsibility in Infinite-Domain Quantified Constraint Satisfaction -- Towards an Implicit Characterization of NC k -- On Rational Trees -- Reasoning About States of Probabilistic Sequential Programs -- Concurrent Games with Tail Objectives -- Nash Equilibrium for Upward-Closed Objectives -- Algorithms for Omega-Regular Games with Imperfect Information -- Relating Two Standard Notions of Secrecy -- Jump from Parallel to Sequential Proofs: Multiplicatives -- First-Order Queries over One Unary Function -- Infinite State Model-Checking of Propositional Dynamic Logics -- Weak Bisimulation Approximants -- Complete Problems for Higher Order Logics -- Solving Games Without Determinization -- Game Quantification on Automatic Structures and Hierarchical Model Checking Games -- An Algebraic Point of View on the Crane Beach Property -- A Sequent Calculus for Type Theory -- Universality Results for Models in Locally Boolean Domains -- Universal Structures and the Logic of Forbidden Patterns -- On the Expressive Power ofGraph Logic -- Hoare Logic in the Abstract -- Normalization of IZF with Replacement -- Acyclicity and Coherence in Multiplicative Exponential Linear Logic -- Church Synthesis Problem with Parameters -- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates -- Separation Logic for Higher-Order Store -- Satisfiability and Finite Model Property for the Alternating-Time ?-Calculus -- Space-Efficient Computation by Interaction -- The Ackermann Award 2006.This book constitutes the refereed proceedings of the 20th International Workshop on Computer Science Logic, CSL 2006. The book presents 37 revised full papers together with 4 invited contributions, addressing all current aspects of logic in computer science. Coverage includes automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and formal logics, modal and temporal logic, model checking, finite model theory, and more.Theoretical Computer Science and General Issues,2512-2029 ;4207Compilers (Computer programs)Computer scienceMachine theoryArtificial intelligenceMathematical logicCompilers and InterpretersTheory of ComputationFormal Languages and Automata TheoryArtificial IntelligenceComputer Science Logic and Foundations of ProgrammingMathematical Logic and FoundationsCompilers (Computer programs).Computer science.Machine theory.Artificial intelligence.Mathematical logic.Compilers and Interpreters.Theory of Computation.Formal Languages and Automata Theory.Artificial Intelligence.Computer Science Logic and Foundations of Programming.Mathematical Logic and Foundations.005.1/015113Esik Zoltan1951-1757034European Association for Computer Science Logic.Conference(15th :Szeged, Hungary)Workshop on Computer Science LogicMiAaPQMiAaPQMiAaPQBOOK9910483865403321Computer science logic4194674UNINA