LEADER 05915nam 22007215 450 001 996465475103316 005 20200629130328.0 010 $a3-540-47285-1 024 7 $a10.1007/BFb0023753 035 $a(CKB)1000000000233856 035 $a(SSID)ssj0000322132 035 $a(PQKBManifestationID)11232343 035 $a(PQKBTitleCode)TC0000322132 035 $a(PQKBWorkID)10280369 035 $a(PQKB)10795135 035 $a(DE-He213)978-3-540-47285-8 035 $a(PPN)155203592 035 $a(EXLCZ)991000000000233856 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings /$fedited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (VIII, 431 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v626 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55789-X 327 $aThe expressive power of transitive closure and 2-way multihead automata -- Correctness proof for the WAM with types -- Model checking of persistent Petri nets -- Provability in TBLL: A decision procedure -- How to implement first order formulas in local memory machine models -- A new approach to abstract data types II computation on ADTs as ordinary computation -- A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation -- On bounded theories -- The cutting plane proof system with bounded degree of falsity -- Denotational versus declarative semantics for functional programming -- On transitive closure logic -- Some aspects of the probabilistic behavior of variants of resolution -- Safe queries in relational databases with functions -- Logical inference and polyhedral projection -- Stable logic -- A transformational methodology for proving termination of logic programs -- Plausibility logic -- Towards Kleene Algebra with recursion -- Equational specification of abstract types and combinators -- Normal forms in infinite-valued logic: The case of one variable -- A fragment of first order logic adequate for observation equivalence -- Ordinal processes in comparative concurrency semantics -- Logical semantics of modularisation -- A cut-elimination procedure designed for evaluating proofs as programs -- Minimal from classical proofs -- Quantifier hierarchies over word relations -- Complexity results for the default- and the autoepistemic logic -- On Completeness for NP via projection translations -- Control of ?-automata, Church's problem, and the emptiness problem for tree ?-automata -- Comparing the theory of representations and constructive mathematics -- Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic -- On completeness of program synthesis systems -- Proving termination for term rewriting systems. 330 $aThis volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v626 606 $aComputers 606 $aMathematical logic 606 $aComputer logic 606 $aAlgorithms 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 615 0$aComputers. 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aMathematical Logic and Foundations. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 676 $a004.0151 702 $aBörger$b Egon$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJäger$b Gerhard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKleine Büning$b Hans$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRichter$b Michael M$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465475103316 996 $aComputer Science Logic$9771972 997 $aUNISA