Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
EUR 11,24
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardback. Etat : Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
Vendeur : thebookforest.com, San Rafael, CA, Etats-Unis
EUR 58,38
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : LikeNew. Text block, wraps and binding are in like new condition, without markings of any kind. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.
EUR 57,45
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierSoftcover. Etat : Very good. Great condition. Cover and edges are slightly worn. Inside is clean and unmarked.
EUR 62,54
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. D03769 Ex-library with Stamp and Library-Signature in Good Condition, Some Traces of Use 9773540212028 Sprache: Englisch Gewicht in Gramm: 550.
Vendeur : Bartleby's Books, Wilmington, VT, Etats-Unis
EUR 88,38
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Used - Very Good. Etat de la jaquette : Very Good.
Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2010
ISBN 10 : 3642059481 ISBN 13 : 9783642059483
Langue: anglais
Vendeur : Grand Eagle Retail, Mason, OH, Etats-Unis
Edition originale
EUR 95,88
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : new. Paperback. Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE~s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es sentially first-order predicate calculus or its minor extensions. Finite model theory is an area of mathematical logic that grew out of computer science applications. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
EUR 93,56
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2004
ISBN 10 : 3540212027 ISBN 13 : 9783540212027
Langue: anglais
Vendeur : Grand Eagle Retail, Mason, OH, Etats-Unis
EUR 95,90
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : new. Hardcover. Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE~s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es sentially first-order predicate calculus or its minor extensions. Finite model theory is an area of mathematical logic that grew out of computer science applications. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
EUR 93,58
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 93,76
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 94,18
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 106,06
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 106,06
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 111,16
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 111,31
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 99,79
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 99,79
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 86,46
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,600grams, ISBN:9783642059483.
EUR 99,78
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 99,78
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 100,03
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
EUR 128,41
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 336.
EUR 114,45
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 114,59
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2010
ISBN 10 : 3642059481 ISBN 13 : 9783642059483
Langue: anglais
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 117,89
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 318 pages, 7 black & white illustrations, biography. BIC Classification: PBCD. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 17. Weight in Grams: 516. . 2010. Softcover reprint of hardcover 1st ed. 2004. Paperback. . . . .
Vendeur : BennettBooksLtd, San Diego, NV, Etats-Unis
EUR 131,93
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : New. In shrink wrap. Looks like an interesting title!
Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2004
ISBN 10 : 3540212027 ISBN 13 : 9783540212027
Langue: anglais
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 124,24
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. Provides an introduction to finite model theory which stresses the computer science origins of the area. This book deals with the applications in databases, complexity theory, and formal languages, as well as other branches of computer science. It covers Ehrenfeucht-Fraisse games, locality-based techniques, and the complexity analysis of logics. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 318 pages, 7 black & white illustrations, biography. BIC Classification: PBCD. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 243 x 168 x 26. Weight in Grams: 630. . 2004. Hardback. . . . .
Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2010
ISBN 10 : 3642059481 ISBN 13 : 9783642059483
Langue: anglais
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
EUR 147,37
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 318 pages, 7 black & white illustrations, biography. BIC Classification: PBCD. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 17. Weight in Grams: 516. . 2010. Softcover reprint of hardcover 1st ed. 2004. Paperback. . . . . Books ship from the US and Ireland.
Edité par Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10 : 3642059481 ISBN 13 : 9783642059483
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 96,29
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Neuware -Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE~s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es sentially first-order predicate calculus or its minor extensions.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 336 pp. Englisch.
Edité par Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2004, 2004
ISBN 10 : 3540212027 ISBN 13 : 9783540212027
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 96,29
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. Neuware -Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE~s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es sentially first-order predicate calculus or its minor extensions.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 336 pp. Englisch.