Seven proceedings papers from the January 1996 workshop introducing new research in areas connected with finite model theory as it relates to computational complexity, database theory, and combinatorics. The seven papers feature discussions on easier ways to win logical games, the expression of graph properties in some fragments of monadic second-order logic, finite models, automata, circuit complexity, databases and finite-model theory, modal logic, model checking and the Mu-calculus, and algebraic propositional proof systems. Lacks an index. Annotation c. by Book News, Inc., Portland, Or.
"synopsis" may belong to another edition of this title.
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. 'We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation' - from the Preface. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. The volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996 during a DIMACS-sponsored Special Year on Logic and Algorithms. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory. Seller Inventory # LU-9780821805176
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 10.50x7.50x0.75 inches. In Stock. Seller Inventory # __0821805177
Quantity: 2 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780821805176_new
Quantity: 2 available
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996. Editor(s): Immerman, Neil; Kolaitis, Phokion G. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 248 pages, Illustrations. BIC Classification: PBCD; PBWH. Category: (P) Professional & Vocational. Dimension: 230. Weight in Grams: 681. . 1997. hardcover. . . . . Books ship from the US and Ireland. Seller Inventory # V9780821805176
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996. Editor(s): Immerman, Neil; Kolaitis, Phokion G. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 248 pages, Illustrations. BIC Classification: PBCD; PBWH. Category: (P) Professional & Vocational. Dimension: 230. Weight in Grams: 681. . 1997. hardcover. . . . . Seller Inventory # V9780821805176
Quantity: 1 available
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. 'We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation' - from the Preface. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. The volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996 during a DIMACS-sponsored Special Year on Logic and Algorithms. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory. Seller Inventory # LU-9780821805176
Quantity: 1 available