Pratt hartmann (59 Ergebnisse)

Paperback. Zustand: Very Good. Advances in Modal Logic, Volume 5: v. 5 This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping.…

Paperback. Zustand: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.

paperback. Zustand: Very Good.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Paperback. Zustand: New.

Zustand: New.

Zustand: New. Advances in Modal Logic, Volume 5 (Paperback or Softback).

Zustand: New. In.

PF. Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: New.

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

hardcover. Zustand: Good. exlibrary hardcover no dust jacket. usual library markings, has some light wear throughout.

Zustand: New. Brand New.

Zustand: New.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: new.

Zustand: As New. Unread book in perfect condition.

Zustand: 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.

Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Hardcover. Zustand: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock.

hardcover. Zustand: New. In shrink wrap. Looks like an interesting title.

Hardcover. Zustand: 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.…

Hardback. Zustand: New. New copy - Usually dispatched within 4 working days.

Zustand: Used. pp. xxii + 1058 1st Edition.