このページのリンク

<電子ブック>
Finite Model Theory : First Edition / by Heinz-Dieter Ebbinghaus, Jörg Flum
(Perspectives in Mathematical Logic)

1st ed. 1995.
出版者 (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年 1995
本文言語 英語
大きさ XV, 327 p : online resource
著者標目 *Ebbinghaus, Heinz-Dieter author
Flum, Jörg author
SpringerLink (Online service)
件 名 LCSH:Mathematical logic
LCSH:Algorithms
LCSH:Machine theory
FREE:Mathematical Logic and Foundations
FREE:Algorithms
FREE:Formal Languages and Automata Theory
一般注記 0. Preliminaries -- 1. The Ehrenfeucht-Fraïssé Method -- 2. More on Games -- 3. 0–1 Laws -- 4. Satisfiability in the Finite -- 5. Finite Automata and Logic: A Microcosm of Finite Model Theory -- 6. Descriptive Complexity Theory -- 7. Logics with Fixed-Point Operators -- 8. Logic Programs -- 9. Optimization Problems -- 10. Quantifiers and Logical Reductions -- References
Finite model theory has its origins in classical model theory, but owes its systematic development to research from complexity theory. The book presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. Other topics include DATALOG languages, quantifiers and oracles, 0-1 laws, and optimization and approximation problems. The book is written in such a way that the resp. parts on model theory and descriptive complexity theory may be read independently
HTTP:URL=https://doi.org/10.1007/978-3-662-03182-7
目次/あらすじ

所蔵情報を非表示

電子ブック オンライン 電子ブック

Springer eBooks 9783662031827
電子リソース
EB00232968

書誌詳細を非表示

データ種別 電子ブック
分 類 LCC:QA8.9-10.3
DC23:511.3
書誌ID 4000110556
ISBN 9783662031827

 類似資料