2001 Logic in Computer Science Symposium/Lics: Proceedings, 16-19 June 2001, Boston, Massachusetts - Softcover

Inhaltsangabe

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. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.