Amazon cover image
Image from Amazon.com
Image from Google Jackets

Finite and Algorithmic Model Theory / Edited by Javier Esparza, Christian Michaux, Charles Steinhorn.

Contributor(s): Material type: TextTextSeries: London Mathematical Society Lecture Note Series ; no. 379 | London Mathematical Society Lecture Note Series ; no. 379.Publisher: Cambridge : Cambridge University Press, 2011Description: 1 online resource (356 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780511974960 (ebook)
Other title:
  • Finite & Algorithmic Model Theory
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 511.3/4 22
LOC classification:
  • QA9.7  .F565 2011
Online resources: Summary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK12116

Title from publisher's bibliographic system (viewed on 16 Oct 2015).

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India