MARC Record from harvard_bibliographic_metadata

LEADER: 03433nam a22004815a 4500
001 014158460-2
005 20141003190656.0
008 100301s1999 gw | o ||0| 0|eng d
020 $a9783540287889
020 $a9783540287872 (ebk.)
020 $a9783540287889
020 $a9783540287872
024 7 $a10.1007/3-540-28788-4$2doi
035 $a(Springer)9783540287889
040 $aSpringer
050 4 $aQA8.9-10.3
072 7 $aMAT018000$2bisacsh
072 7 $aPBC$2bicssc
072 7 $aPBCD$2bicssc
082 04 $a511.3$223
100 1 $aEbbinghaus, Heinz-Dieter,$eauthor.
245 10 $aFinite Model Theory /$cby Heinz-Dieter Ebbinghaus, Jörg Flum.
250 $aSecond Revised and Enlarged Edition 1999.
264 1 $aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bSpringer,$c1999.
300 $aXI, 360 p.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aSpringer Monographs in Mathematics,$x1439-7382
505 0 $aPreliminaries -- The Ehrenfeucht-Fraïssé Method -- More on Games -- 0-1 Laws -- Satisfiability in the Finite -- Finite Automata and Logic: A Microcosm of Finite Model Theory -- Descriptive Complexity Theory -- Logics with Fixed-Point Operators -- Logic Programs -- Optimization Problems -- Logics for PTIME -- Quantifiers and Logical Reductions.
520 $aFinite model theory, the model theory of finite structures, has roots in clas­ sical model theory; however, its systematic development was strongly influ­ enced by research and questions of complexity theory and of database theory. Model theory or the theory of models, as it was first named by Tarski in 1954, may be considered as the part of the semantics of formalized languages that is concerned with the interplay between the syntactic structure of an axiom system on the one hand and (algebraic, settheoretic, . . . ) properties of its models on the other hand. As it turned out, first-order language (we mostly speak of first-order logic) became the most prominent language in this respect, the reason being that it obeys some fundamental principles such as the compactness theorem and the completeness theorem. These principles are valuable modeltheoretic tools and, at the same time, reflect the expressive weakness of first-order logic. This weakness is the breeding ground for the freedom which modeltheoretic methods rest upon. By compactness, any first-order axiom system either has only finite models of limited cardinality or has infinite models. The first case is trivial because finitely many finite structures can explicitly be described by a first-order sentence. As model theory usually considers all models of an axiom system, modeltheorists were thus led to the second case, that is, to infinite structures. In fact, classical model theory of first-order logic and its generalizations to stronger languages live in the realm of the infinite.
650 10 $aMathematics.
650 0 $aComputer science.
650 0 $aLogic, Symbolic and mathematical.
650 0 $aMathematics.
650 24 $aMathematical Logic and Formal Languages.
650 24 $aMathematical Logic and Foundations.
700 1 $aFlum, Jörg,$eauthor.
776 08 $iPrinted edition:$z9783540287872
830 0 $aSpringer Monographs in Mathematics.
988 $a20140910
906 $0VEN