16th Symposium on Logic in Computer Science, 2001, Boston, MA

Author/creator Symposium on Logic in Computer Science Staff
Other author IEEE Xplore (Online service)
Format Electronic
Publication InfoLos Alamitos : IEEE Computer Society Press
Description441 p. 27.000 x 021.000 cm.
Supplemental ContentFull text available from IEEE Electronic Library (IEL)
Supplemental ContentFull text available from IEEE Electronic Library (IEL) Conference Proceedings
Subjects

Summary Annotation Proceedings of a June 2001 symposium. Topics include a decision procedure for an extensional theory of arrays, semantics of name and value passing, the decision problem for the guarded fragment with transitivity, a universal characterization of the closed Euclidean interval, a second-order system for polytime reasoning using Graedel's theorem, a n! lower bound on formula size, light affine lambda calculus and polytime strong normalization, semantics of machine instructions at multiple levels of abstraction, recursive programming languages for complexity classes, and computing the density of regular languages. This volume lacks a subject index. c. Book News Inc.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
ISBN9780769512815
ISBN076951281X (Trade Paper) Active Record
Standard identifier# 9780769512815
Stock number00029433

Availability

Library Location Call Number Status Item Actions
Electronic Resources ✔ Available