{totalEditions} {editionMessage} in {totalHoldingCount} {libraryMessage}

This edition in {totalHoldingCount} libraries

{libraryName} added to favorite libraries

{libraryName} removed from favorite libraries

Better World Books

AbeBooks

VitalSource

Amazon

Barnes & Noble

Select this title to view the detailed record for {title}

Added: {formattedDate}

New at the library

All ({x})

Fiction

Nonfiction

View access options

Access from your libraries

Borrow from {library}

{formattedDistance} away

Borrow

Borrow from {institution} near {location}

Access Online

Request this item via:

Get it from {institution}

Borrow from your library

Borrow from {institution}

Unable to find any access options. Search the library catalog.

Check out this item I found on https://worldcat.org

Cite list {title}

Cite

Share

Add to list

Share list {title}

Item shared from WorldCat.org

Edition

Publisher

View all Formats and Editions for {title}

Dissertation

View all formats and editions

Unable to find libraries on WorldCat with this item.

Access

ISSN

Cast

Language Notes

Notes

Genre

ISBN

Subjects

Medium of Performance

Event Notes

Reproduction Notes

Show less information

Series

Publication

Credits

Show more information

Performers

Additional Physical Form Entry

Click this link to view the DOI record {x}

Physical Description

OCLC Number / Unique Identifier

Target Audience

Numeric Designation of Musical Work

More Information

Cartographic Mathematical Data

We tailor your experience based on the order of your favorite libraries.

Drag or select a library from below to update the order

use the arrow up and down keys to change the order

{0}, order {1} in the list of {2} libraries

Unable to save libraries order. Please try again

To save changes to the library order, press Done

You can set up to 1 favorite library

WorldCat.org

Before we transfer your account, would you like to move your lists and libraries as well?

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-Fraisse 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.

"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

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