عنوان
پدید آورنده
موضوع
رده
QA 9.7 .F565 2011
QA
9
.
7
.
F565
2011
کتابخانه
محل استقرار
85868
Finite and algorithmic model theory
Cambridge
Cambridge University Press
2011
xi, 341 p.: ill.
London Mathematical Society lecture note series; 973
Includes index
edited by Javier Esparza, Christian Michaux, Charles Steinhorn
Machine generated contents note: Preface Javier Esparza, Christian Michaux and Charles Steinhorn; Automata-based presentations of infinite structures Vince Barany, 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
، Finite model theory
Mathematics ، Computer science
511
.
3/4
QA
9
.
7
.
F565
2011
TI
AU reivaJ ,azrapsE ed
AU naitsirhC ,xuahciM ed
AU selrahC ,nrohnietS ed
SE
یاضه ریه دانشکدانابخکت
