Items related to Fragments of First-Order Logic (Oxford Logic Guides)
Synopsis
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?
"synopsis" may belong to another edition of this title.
About the Author
Ian Pratt-Hartmann, Senior Lecturer, University of Manchester Professor of Mathematical Sciences, University of Opole,
Ian Pratt-Hartmann studied mathematics and philosophy at Brasenose College, Oxford, and philosophy at Princeton and Stanford Universities, gaining his PhD from Princeton in 1987. He is currently Senior Lecturer in the Department of Computer Science at the University of Manchester as well as Professor of Mathematical Sciences in the Institute of Computer Science at the University of Opole, and recently held an appointment as Visiting Professor at the Department of Mathematics, Computer Science and Mechanics at the University of Warsaw.
"About this title" may belong to another edition of this title.
Search results for Fragments of First-Order Logic (Oxford Logic Guides)
Stock Image
Fragments of First-Order Logic Format: Hardback
Seller: INDOO, Avenel, NJ, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Brand New. Seller Inventory # 9780192867964
Stock Image
Fragments of First-order Logic
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 44788219-n
Stock Image
Fragments of First-Order Logic
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FU-9780192867964
Stock Image
Fragments of First-order Logic
Published by
Oxford University Press, 2023
ISBN 10: 0192867962
ISBN 13: 9780192867964
Used
Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 44788219
Stock Image
Fragments of First-Order Logic
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FU-9780192867964
Buy New
US$ 188.83
US$ 10.10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 12 available
Stock Image
Fragments of First-Order Logic (eng)
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 5 out of 5 stars
Condition: new. Seller Inventory # ABOE6JJHCO
Buy New
US$ 189.14
US$ 12.52 shipping
Ships from Italy to U.S.A.
Ships from Italy to U.S.A.
Quantity: 12 available
Stock Image
Fragments of First-order Logic
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 44788219-n
Buy New
US$ 188.82
US$ 19.86 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 16 available
Stock Image
Fragments of First-order Logic
Published by
Oxford University Press, 2023
ISBN 10: 0192867962
ISBN 13: 9780192867964
Used
Hardcover
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 44788219
Buy Used
US$ 200.71
US$ 19.86 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 16 available
Stock Image
Fragments of First-order Logic
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock. Seller Inventory # __0192867962
Buy New
US$ 204.44
US$ 19.86 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Fragments of First-Order Logic (Hardcover)
Published by
Oxford University Press, Oxford, 2023
ISBN 10: 0192867962
ISBN 13: 9780192867964
New
Hardcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # 9780192867964