hardcover. Condizione: Good. exlibrary hardcover no dust jacket. usual library markings, has some light wear throughout.
EUR 129,28
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Brand New.
Condizione: New.
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
EUR 152,37
Quantità: 13 disponibili
Aggiungi al carrelloCondizione: new.
EUR 166,09
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 165,44
Quantità: 13 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
EUR 164,88
Quantità: 16 disponibili
Aggiungi al carrelloCondizione: New.
EUR 166,24
Quantità: 16 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 169,80
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock.
EUR 178,38
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
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 263,29
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock.
Lingua: Inglese
Editore: Oxford University Press Jun 2023, 2023
ISBN 10: 0192867962 ISBN 13: 9780192867964
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 269,19
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - 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.