EUR 57,97
Cantidad disponible: 1 disponibles
Añadir al carritoSoftcover. Condición: Very good. Great condition. Cover and edges are slightly worn. Inside is clean and unmarked.
Librería: thebookforest.com, San Rafael, CA, Estados Unidos de America
EUR 68,59
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Like New. 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.
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
EUR 70,75
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: 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!
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
EUR 76,27
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.
EUR 73,58
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. D03769 Ex-library with Stamp and Library-Signature in Good Condition, Some Traces of Use 9773540212028 Sprache: Englisch Gewicht in Gramm: 550.
Librería: Bartleby's Books, Wilmington, VT, Estados Unidos de America
EUR 89,19
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Used - Very Good. Estado de la sobrecubierta: Very Good.
EUR 95,81
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 94,62
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 96,23
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 95,03
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 98,59
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 98,59
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 85,43
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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 98,58
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 98,58
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 98,83
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
EUR 129,22
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 336.
EUR 115,28
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: BennettBooksLtd, San Diego, NV, Estados Unidos de America
EUR 133,13
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
EUR 86,70
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Elements of Finite Model Theory | Leonid Libkin | Taschenbuch | xiv | Englisch | 2010 | Springer | EAN 9783642059483 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2004, 2004
ISBN 10: 3540212027 ISBN 13: 9783540212027
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 96,29
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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.
Publicado por Springer Berlin Heidelberg, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 96,29
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 96,28
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 160,56
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
EUR 169,92
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 191,00
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 198,20
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 167,59
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Publicado por Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 96,29
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por Springer Berlin Heidelberg Jul 2004, 2004
ISBN 10: 3540212027 ISBN 13: 9783540212027
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 96,29
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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.