000			01129pam a2200217 a 4500
008			950712s1995 gw a b 001 0 eng
020			_a354060149X
041			_aeng
080			_a510.6 _bEBB
100	1		_aEbbinghaus, Heinz-Dieter
245	1	0	_aFinite Model Theory
260			_aBerlin _bSpringer _c1995
300			_axv, 327p
440		0	_aPerspectives in Mathematical Logic
505			_a1. The Ehrenfeucht-Fraisse 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
520			_aA study which presents the results of descriptive complexity theory, the connection between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The parts on the model theory and descriptive complexity theory may also be read independently.
650		0	_aModel theory
690			_aMathematics
700	1		_aFlum, Jörg
942			_cBK
999			_c13197 _d13197