hardcover. Condizione: Good. exlibrary hardcover no dust jacket. usual library markings, has some light wear throughout.
Condizione: New.
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
EUR 165,28
Quantità: 13 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
EUR 160,49
Quantità: 13 disponibili
Aggiungi al carrelloCondizione: new.
EUR 174,87
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
EUR 165,27
Quantità: 16 disponibili
Aggiungi al carrelloCondizione: New.
EUR 174,86
Quantità: 16 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 178,94
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock.
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
Lingua: Inglese
Editore: Oxford University Press, Oxford, 2023
ISBN 10: 0192867962 ISBN 13: 9780192867964
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: new. Hardcover. A sentence of first-order logic is satisfiable if it is true in some structure, and finitely satisfiable if it is true in some finite structure. The question arises as to whether there exists an algorithm for determining whether a given formula of first-order logic is satisfiable, or indeed finitely satisfiable. This question was answered negatively in 1936 by Church and Turing (for satisfiability) and in 1950 by Trakhtenbrot (for finite satisfiability).In contrast,the satisfiability and finite satisfiability problems are algorithmically solvable for restricted subsets---or, as we say, fragments---of first-order logic, a fact which is today of considerableinterest in Computer Science. This book provides an up-to-date survey of the principal axes of research, charting the limits of decision in first-order logic and exploring the trade-off between expressive power and complexity of reasoning.Divided into three parts, the book considers for which fragments of first-order logic there is an effective method for determining satisfiability or finite satisfiability. Furthermore, if these problems are decidable for some fragment,what is their computational complexity? Part I focusses on fragments defined by restricting the set of available formulas. Topics covered include the Aristotelian syllogistic and its relatives, thetwo-variable fragment, the guarded fragment, the quantifier-prefix fragments and the fluted fragment. Part II investigates logics with counting quantifiers. Starting with De Morgan's numerical generalization of the Aristotelian syllogistic, we proceed to the two-variable fragment with counting quantifiers and its guarded subfragment, explaining the applications of the latter to the problem of query answering in structured data. Part III concerns logics characterized by semantic constraints,limiting the available interpretations of certain predicates. Taking propositional modal logic and graded modal logic as our cue, we return to the satisfiability problem for two-variable first-order logicand its relatives, but this time with certain distinguished binary predicates constrained to be interpreted as equivalence relations or transitive relations. The work finishes, slightly breaching the bounds of first-order logic proper, with a chapter on logics interpreted over trees. Pratt-Hartmann considers for which fragments of first-order logic there is an effective method for determining satisfiability or finite satisfiability. Furthermore, he asks, if these problems are decidable for some fragment, what is their computational complexity? Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
EUR 219,72
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
Condizione: Used. pp. xxii + 1058 1st Edition.
EUR 274,71
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Used. pp. xxii + 1058.
EUR 273,14
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Used. pp. xxii + 1058.
EUR 281,66
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock.
EUR 311,17
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 311,17
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 274,55
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Handbook of Spatial Logics | Marco Aiello (u. a.) | Taschenbuch | xxi | Englisch | 2016 | Springer Netherland | EAN 9789402404708 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Lingua: Inglese
Editore: Oxford University Press Jun 2023, 2023
ISBN 10: 0192867962 ISBN 13: 9780192867964
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 287,41
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - A sentence of first-order logic is satisfiable if it is true in some structure, and finitely satisfiable if it is true in some finite structure. The question arises as to whether there exists an algorithm for determining whether a given formula of first-order logic is satisfiable, or indeed finitely satisfiable. This question was answered negatively in 1936 by Church and Turing (for satisfiability) and in 1950 by Trakhtenbrot (for finite satisfiability).In contrast, the satisfiability and finite satisfiability problems are algorithmically solvable for restricted subsets---or, as we say, fragments---of first-order logic, a fact which is today of considerable interest in Computer Science. This book provides an up-to-date survey of the principal axes of research, charting the limits of decision in first-order logic and exploring the trade-off between expressive power and complexity of reasoning. Divided into three parts, the book considers for which fragments of first-order logic there is an effective method for determining satisfiability or finite satisfiability. Furthermore, if these problems are decidable for some fragment, what is their computational complexity Part I focusses on fragments defined by restricting the set of available formulas. Topics covered include the Aristotelian syllogistic and its relatives, the two-variable fragment, the guarded fragment, the quantifier-prefix fragments and the fluted fragment. Part II investigates logics with counting quantifiers. Starting with De Morgan's numerical generalization of the Aristotelian syllogistic, we proceed to the two-variable fragment with counting quantifiers and its guarded subfragment, explaining the applications of the latter to the problem of query answering in structured data. Part III concerns logics characterized by semantic constraints, limiting the available interpretations of certain predicates. Taking propositional modal logic and graded modal logic as our cue, we return to the satisfiability problem for two-variable first-order logic and its relatives, but this time with certain distinguished binary predicates constrained to be interpreted as equivalence relations or transitive relations. The work finishes, slightly breaching the bounds of first-order logic proper, with a chapter on logics interpreted over trees.
EUR 377,88
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Softcover Reprint of the Original 1st 2007 ed.
EUR 333,77
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - A spatial logic is a formal language interpreted over any class of structures featuring geometrical entities and relations, broadly construed. In the past decade, spatial logics have attracted much attention in response to developments in such diverse fields as Artificial Intelligence, Database Theory, Physics, and Philosophy. The aim of this handbook is to create, for the first time, a systematic account of the field of spatial logic. The book comprises a general introduction, followed by fourteen chapters by invited authors. Each chapter provides a self-contained overview of its topic, describing the principal results obtained to date, explaining the methods used to obtain them, and listing the most important open problems. Jointly, these contributions constitute a comprehensive survey of this rapidly expanding subject.
EUR 333,77
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - A spatial logic is a formal language interpreted over any class of structures featuring geometrical entities and relations, broadly construed. In the past decade, spatial logics have attracted much attention in response to developments in such diverse fields as Artificial Intelligence, Database Theory, Physics, and Philosophy. The aim of this handbook is to create, for the first time, a systematic account of the field of spatial logic. The book comprises a general introduction, followed by fourteen chapters by invited authors. Each chapter provides a self-contained overview of its topic, describing the principal results obtained to date, explaining the methods used to obtain them, and listing the most important open problems. Jointly, these contributions constitute a comprehensive survey of this rapidly expanding subject.
EUR 358,94
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. A spatial logic is a formal language interpreted over any class of structures featuring geometrical entities and relations, broadly construed. In the past decade, spatial logics have attracted much attention in response to developments in such diverse fields as Artificial Intelligence, Database Theory, Physics, and Philosophy. The aim of this handbook is to create, for the first time, a systematic account of the field of spatial logic. The book comprises a general introduction, followed by fourteen chapters by invited authors. Each chapter provides a self-contained overview of its topic, describing the principal results obtained to date, explaining the methods used to obtain them, and listing the most important open problems. Jointly, these contributions constitute a comprehensive survey of this rapidly expanding subject. Softcover Reprint of the Original 1st 2007 ed.
Da: UK BOOKS STORE, London, LONDO, Regno Unito
EUR 596,75
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
EUR 621,81
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 246,33
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Da: moluna, Greven, Germania
EUR 267,86
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The first systematic account of the field of spatial logicOf interest to academics and graduate students working in the areas of Geometry, Topology, Logic, Computer Science and PhilosophyGathers together results on logic and geometry curren.