Finite and Algorithmic Model Theory (Paperback)

Javier Esparza

ISBN 10: 0521718201 / ISBN 13: 9780521718202

Published by Cambridge University Press, Cambridge, 2011

About this Item

Paperback. Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research. Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. The chapters include extensive bibliographies. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Seller Inventory # 9780521718202

Bibliographic Details

• Title: Finite and Algorithmic Model Theory (Paperback)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2011
• Language: English
• ISBN 10: 0521718201
• ISBN 13: 9780521718202
• Binding: Paperback
• Condition: new

About this title

Synopsis

Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research.

About the Authors

Javier Esparza has held the Chair for Foundations of Software Reliability and Theoretical Computer Science at the Technische Universität München since 2007.

Christian Michaux has held the Chair of Mathematical Logic at the University of Mons (UMONS, formerly Université de Mons-Hainaut) since 2000. He is currently Dean of the Faculty of Sciences.

Charles Steinhorn is Professor of Mathematics at Vassar College, where he has served as Chair of the Mathematics Department and Associate Dean of the Faculty.