Da: thebookforest.com, San Rafael, CA, U.S.A.
EUR 62,69
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Da: HPB-Red, Dallas, TX, U.S.A.
EUR 65,95
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: 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!
Da: WorldofBooks, Goring-By-Sea, WS, Regno Unito
EUR 72,78
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
EUR 73,58
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. D03769 Ex-library with Stamp and Library-Signature in Good Condition, Some Traces of Use 9773540212028 Sprache: Englisch Gewicht in Gramm: 550.
Da: Bartleby's Books, Wilmington, VT, U.S.A.
EUR 88,01
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Used - Very Good. Condizione sovraccoperta: Very Good.
EUR 93,18
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Best Price, Torrance, CA, U.S.A.
EUR 87,61
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloCondizione: New. SUPER FAST SHIPPING.
Da: Best Price, Torrance, CA, U.S.A.
EUR 87,61
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: New. SUPER FAST SHIPPING.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 93,37
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 94,96
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 93,78
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 105,62
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 105,62
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 111,10
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 100,11
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 103,80
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 100,35
Convertire valutaQuantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
EUR 103,30
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 103,78
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 108,82
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 114,96
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 130,73
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 336.
Da: BennettBooksLtd, North Las Vegas, NV, U.S.A.
EUR 131,38
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 96,29
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2004, 2004
ISBN 10: 3540212027 ISBN 13: 9783540212027
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 96,29
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
Editore: Springer Berlin Heidelberg, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 96,29
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 96,28
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 170,17
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
EUR 202,27
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Editore: Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 96,29
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Emphasizes the computer science aspects of the subject.Details applications in databases, complexity theory, and formal languages, as well as other branches of computer science. 336 pp. Englisch.