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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 10.50x7.50x0.75 inches. In Stock. Artikel-Nr. __0821805177
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: 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. Artikel-Nr. V9780821805176
Anzahl: 1 verfügbar