Skip to content
Library Home
Start Over
Research Databases
E-Journals
Course Reserves
Library Home
Login to library account
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Language
Library Catalog
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced Search
|
Browse
|
Search Tips
Finite and algorithmic model t...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Finite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn.
Saved in:
Bibliographic Details
Other Authors:
Esparza, Javier
,
Michaux, Christian
,
Steinhorn, Charles
Format:
Book
Language:
English
Published:
Cambridge ; New York :
Cambridge University Press,
2011.
Series:
London Mathematical Society lecture note series ;
379.
Subjects:
Finite model theory.
Computer science
>
Mathematics.
Holdings
Description
Table of Contents
Similar Items
Staff View
Table of Contents:
Preface Javier Esparza, Christian Michaux and Charles Steinhorn; Automata-based presentations of infinite structures Vince Bárány, Erich Gra;del and Sasha Rubin; Logical aspects of spatial databases Bart Kuijpers and Jan Van den Bussche; Some connections between finite and infinite model theory Vera Koponen; Algorithmic meta-theorems Stephan Kreutzer; Definability in classes of finite structures H. Dugald Macpherson and Charles Steinhorn; Model theoretic methods for fragments of FO and special classes of (finite) structures Martin Otto.
Similar Items
Groups of finite Morley rank
by: Borovik, Alexandre
Published: (1994)
Simple groups of finite Morley rank
by: Altinel, Tuna, 1966-
Published: (2008)
Model theoretic methods in finite combinatorics : AMS-ASL joint special session, January 5-8, 2009 Washington, DC
Published: (2011)
Model Theoretic Methods in Finite Combinatorics
by: Grohe, Martin
Published: (2011)
The role of true finiteness in the admissible recursively enumerable degrees
by: Greenberg, Noam, 1974-
Published: (2006)