Coverart for item
The Resource Computer science logic : 6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers, E. Börger [and others], eds

Computer science logic : 6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers, E. Börger [and others], eds

Label
Computer science logic : 6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers
Title
Computer science logic
Title remainder
6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers
Statement of responsibility
E. Börger [and others], eds
Creator
Contributor
Subject
Genre
Language
eng
Summary
This volume presents the proceedings of the Computer Science Logic Workshop CSL '92, held in Pisa, Italy, in September/October 1992. CSL '92 was the sixth of the series and the first one held as Annual Conference of the European Association for Computer Science Logic (EACSL). Full versions of the workshop contributions were collected after their presentation and reviewed. On the basis of 58 reviews, 26 papers were selected for publication, and appear here in revised final form. Topics covered in the volume include: Turing machines, linear logic, logic of proofs, optimization problems, lambda calculus, fixpoint logic, NP-completeness, resolution, transition system semantics, higher order partial functions, evolving algebras, functional logic programming, inductive definability, semantics of C, classes for a functional language, NP-optimization problems, theory of types and names, sconing and relators, 3-satisfiability, Kleene's slash, negation-complete logic programs, polynomial-time oracle machines, and monadic second-order properties
Member of
Action
digitized
Cataloging source
OCLCE
Dewey number
004/.01/5113
Illustrations
illustrations
Index
no index present
LC call number
QA75.5
LC item number
.W624 1992
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1992
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
702
http://library.link/vocab/subjectName
  • Computer science
  • Logic, Symbolic and mathematical
  • Informatique
  • Logique symbolique et mathématique
  • Computer science
  • Logic, Symbolic and mathematical
  • Informatik
  • Logik
  • Fundamentele informatica
  • Logica
  • Programmeertalen
  • Logica E Semantica De Programacao
  • Logique symbolique et mathématique
  • San Miniato <1992>
Label
Computer science logic : 6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers, E. Börger [and others], eds
Instantiates
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
A universal Turing machine -- Recursive inseparability in linear logic -- The basic logic of proofs -- Algorithmic structuring of cut-free proofs -- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions -- Linear?-calculus and categorical models revisited -- A self-interpreter of lambda calculus having a normal form -- An "Ehrenfeucht-Fras̐š game" for fixpoint logic and stratified fixpoint logic -- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness -- Model building by resolution -- Comparative transition system semantics -- Reasoning with higher order partial functions -- Communicating evolving algebras -- On the completeness of narrowing as the operational semantics of functional logic programming -- Inductive definability with counting on finite structures -- Linear time algorithms and NP-complete problems -- The semantics of the C programming language -- A theory of classes for a functional language with effects -- Logical definability of NP-optimisation problems with monadic auxiliary predicates -- Universes in the theories of types and names -- Notes on sconing and relators -- Solving 3-satisfiability in less than 1, 579n steps -- Kleene's slash and existence of values of open terms in type theory -- Negation-complete logic programs -- Logical characterization of bounded query classes II: Polynomial-time oracle machines -- On asymptotic probabilities of monadic second order properties
Control code
693145352
Dimensions
unknown
Extent
1 online resource (viii, 439 pages)
Form of item
online
Isbn
9783540478904
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)693145352
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 : 6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers, E. Börger [and others], eds
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
A universal Turing machine -- Recursive inseparability in linear logic -- The basic logic of proofs -- Algorithmic structuring of cut-free proofs -- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions -- Linear?-calculus and categorical models revisited -- A self-interpreter of lambda calculus having a normal form -- An "Ehrenfeucht-Fras̐š game" for fixpoint logic and stratified fixpoint logic -- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness -- Model building by resolution -- Comparative transition system semantics -- Reasoning with higher order partial functions -- Communicating evolving algebras -- On the completeness of narrowing as the operational semantics of functional logic programming -- Inductive definability with counting on finite structures -- Linear time algorithms and NP-complete problems -- The semantics of the C programming language -- A theory of classes for a functional language with effects -- Logical definability of NP-optimisation problems with monadic auxiliary predicates -- Universes in the theories of types and names -- Notes on sconing and relators -- Solving 3-satisfiability in less than 1, 579n steps -- Kleene's slash and existence of values of open terms in type theory -- Negation-complete logic programs -- Logical characterization of bounded query classes II: Polynomial-time oracle machines -- On asymptotic probabilities of monadic second order properties
Control code
693145352
Dimensions
unknown
Extent
1 online resource (viii, 439 pages)
Form of item
online
Isbn
9783540478904
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)693145352
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.

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...