Research Catalog

Computer science logic : 6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers

Title: Computer science logic : 6th workshop, CSL '92, San Miniato, Italy, September 28-October 2, 1992 : selected papers / E. Börger [and others], eds.
Author: Workshop on Computer Science Logic (6th : 1992 : San Miniato, Italy)
Publication: Berlin ; New York : Springer-Verlag, ©1993.

Items in the Library & Off-site

Filter by

1 Item

Item details
Status	Format	Access	Call Number	Item Location
Request for On-site Use Request Scan How do I pick up this item and when will it be ready?	Text	Use in library	QA75.5 .W624 1992	Off-site

Details

Additional Authors

Börger, E. (Egon), 1946-

Description

viii, 439 pages : illustrations; 24 cm.

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."--PUBLISHER'S WEBSITE.

Series Statement

Lecture notes in computer science ; 702

Uniform Title

Lecture notes in computer science ; 702.

Subject

Genre/Form

Conference papers and proceedings

Bibliography (note)

Includes bibliographical references.

Contents

A Universal Turing Machine / Stal Aanderaa -- Recursive Inseparability in Linear Logic / Stal Aanderaa and Herman Ruge Jervell -- The Basic Logic of Proofs / Sergei Artemov and Tyko Strassen -- Algorithmic Structuring of Cut-Free Proofs / Matthias Baaz and Richard Zach -- Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions / Thomas Behrendt, Kevin Compton and Erich Gradel -- Linear [lambda]-Calculus and Categorical Models Revisited / Nick Benton, Gavin Bierman, Valeria de Paiva and Martin Hyland -- A Self-Interpreter of Lambda Calculus Having a Normal Form / Alessandro Berarducci and Corrado Bohm -- An "Ehrenfeucht-Fraisse" Game for Fixpoint Logic and Stratified Fixpoint Logic / Uwe Bosse -- The Class of Problems that Are Linearly Equivalent to Satisfiability, or a Uniform Method for Proving NP-Completeness / Nadia Creignou -- Model Building by Resolution / Christian G. Fermuller and Alexander Leitsch -- Comparative Transition System Semantics / Tim Fernando -- Reasoning with Higher Order Partial Functions / Antonio Gavilanes-Franco, Francisca Lucio-Carrasco and Mario Rodriguez-Artalejo -- Communicating Evolving Algebras / Paola Glavan and Dean Rosenzweig -- On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming / Juan Carlos Gonzalez-Moreno, Maria Teresa Hortala-Gonzalez and Mario Rodriguez-Artalejo -- Inductive Definability with Counting on Finite Structures / Eric Gradel and Martin Otto -- Linear Time Algorithms and NP-Complete Problems / Etienne Grandjean -- The Semantics of the C Programming Language / Yuri Gurevich and James K. Huggins -- A Theory of Classes for a Functional Language with Effects / Furio Honsell, Ian A. Mason, Scott Smith and Carolyn Talcott -- Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates / Clemens Lautemann -- Universes in the Theories of Types and Names / Markus Marzetta -- Notes on Sconing and Relators / John C. Mitchell and Andre Scedrov -- Solving 3-Satisfiability in Less than 1,579[superscript n] Steps / Ingo Schiermeyer -- Kleene's Slash and Existence of Values of Open Terms in Type Theory / Jan M. Smith -- Negation-Complete Logic Programs / Robert F. Stark -- Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines / Iain A. Stewart -- On Asymptotic Probabilities of Monadic Second Order Properties / Jerzy Tyszkiewicz.

ISBN

3540569928
9783540569923
0387569928
9780387569925

LCCN

93244664

OCLC

ocm28684572
28684572
SCSB-9162167

Owning Institutions

Princeton University Library