Seller: thebookforest.com, San Rafael, CA, U.S.A.
Condition: 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.
Softcover. Condition: Very good. Great condition. Cover and edges are slightly worn. Inside is clean and unmarked.
Seller: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
US$ 85.40
Convert currencyQuantity: 1 available
Add to basketHardback. Condition: 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.
US$ 88.94
Convert currencyQuantity: 1 available
Add to basketHardcover. D03769 Ex-library with Stamp and Library-Signature in Good Condition, Some Traces of Use 9773540212028 Sprache: Englisch Gewicht in Gramm: 550.
Seller: Bartleby's Books, Wilmington, VT, U.S.A.
Hardcover. Condition: Used - Very Good. Dust Jacket Condition: Very Good.
US$ 105.87
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Condition: New.
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING.
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 106.09
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 106.55
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 117.47
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
US$ 117.46
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 121.80
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
US$ 117.76
Convert currencyQuantity: 10 available
Add to basketPF. Condition: New.
US$ 121.78
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 121.55
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Condition: New. pp. 336.
Seller: BennettBooksLtd, San Diego, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
US$ 116.38
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: 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.
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2004, 2004
ISBN 10: 3540212027 ISBN 13: 9783540212027
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
US$ 116.38
Convert currencyQuantity: 2 available
Add to basketBuch. Condition: 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.
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 116.38
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 116.37
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Neu. Neu Neuware, auf Lager - 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.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 199.68
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
US$ 219.22
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
US$ 230.93
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 208.06
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.