Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
EUR 72,77
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardback. Condición: 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
Convertir monedaCantidad 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.
EUR 57,05
Convertir monedaCantidad 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 57,97
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 100,10
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 103,79
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 92,92
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 92,92
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 96,28
Convertir monedaCantidad 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.
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
Convertir monedaCantidad 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: California Books, Miami, FL, Estados Unidos de America
EUR 105,32
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 105,32
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 87,37
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 87,37
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
EUR 100,09
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 100,34
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
EUR 103,77
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 103,58
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Bartleby's Books, Wilmington, VT, Estados Unidos de America
EUR 87,77
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Used - Very Good. Estado de la sobrecubierta: Very Good.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642059481 ISBN 13: 9783642059483
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 96,29
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. 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, Springer Berlin Heidelberg Jul 2004, 2004
ISBN 10: 3540212027 ISBN 13: 9783540212027
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 96,29
Convertir monedaCantidad 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.
EUR 130,36
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 336.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 93,11
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 93,52
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
EUR 65,77
Convertir monedaCantidad 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: BennettBooksLtd, San Diego, NV, Estados Unidos de America
EUR 131,01
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 170,15
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
EUR 186,80
Convertir monedaCantidad 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 177,29
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
EUR 202,68
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.