The Resource Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings
Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings
Resource Information
The item Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 711, 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 infinitevalued 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
 Language
 eng
 Extent
 1 online resource (viii, 428 pages)
 Contents

 The expressive power of transitive closure and 2way 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 infinitevalued 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 cutelimination 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
 Isbn
 9783540472858
 Label
 Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings
 Title
 Computer science logic
 Title remainder
 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings
 Title variation
 CSL '91
 Subject

 Computer science
 Computer science  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Informatique  Mathématiques  Congrès
 Logic, Symbolic and mathematical
 Logic, Symbolic and mathematical
 Logic, Symbolic and mathematical  Congresses
 Logica E Semantica De Programacao
 Logique symbolique et mathématique  Congrès
 Logique symbolique et mathématique  Congrès
 Computer science
 Language
 eng
 Summary
 This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 711, 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 infinitevalued 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
 Action
 digitized
 Cataloging source
 SCPER
 Dewey number
 004/.01/5113
 Illustrations
 illustrations
 Index
 no index present
 LC call number
 QA75.5
 LC item number
 .W624 1991
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 1991
 http://bibfra.me/vocab/lite/meetingName
 Workshop on Computer Science Logic
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate
 1946
 http://library.link/vocab/relatedWorkOrContributorName
 Börger, E.
 Series statement
 Lecture notes in computer science,
 Series volume
 626
 http://library.link/vocab/subjectName

 Computer science
 Logic, Symbolic and mathematical
 Informatique
 Logique symbolique et mathématique
 Computer science
 Logic, Symbolic and mathematical
 Logica E Semantica De Programacao
 Logique symbolique et mathématique
 Label
 Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 The expressive power of transitive closure and 2way 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 infinitevalued 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 cutelimination 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
 Control code
 321299604
 Dimensions
 unknown
 Extent
 1 online resource (viii, 428 pages)
 Form of item
 online
 Isbn
 9783540472858
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reproduction note
 Electronic reproduction.
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)321299604
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
 Label
 Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 The expressive power of transitive closure and 2way 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 infinitevalued 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 cutelimination 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
 Control code
 321299604
 Dimensions
 unknown
 Extent
 1 online resource (viii, 428 pages)
 Form of item
 online
 Isbn
 9783540472858
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reproduction note
 Electronic reproduction.
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)321299604
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Subject
 Computer science
 Computer science  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Informatique  Mathématiques  Congrès
 Logic, Symbolic and mathematical
 Logic, Symbolic and mathematical
 Logic, Symbolic and mathematical  Congresses
 Logica E Semantica De Programacao
 Logique symbolique et mathématique  Congrès
 Logique symbolique et mathématique  Congrès
 Computer science
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computersciencelogic5thWorkshopCSL91/U3ASh5wkQ4Q/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computersciencelogic5thWorkshopCSL91/U3ASh5wkQ4Q/">Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computersciencelogic5thWorkshopCSL91/U3ASh5wkQ4Q/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computersciencelogic5thWorkshopCSL91/U3ASh5wkQ4Q/">Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 1991 : proceedings</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>