9780192867964 - fragments of first-order logic di pratt-hartmann, ian (14 risultati)
- Rilegato
Da: mountain, GEORGETOWN, CO, U.S.A.mountain
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 120,81
EUR 4,38 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
hardcover. Condizione: Good. exlibrary hardcover no dust jacket. usual library markings, has some light wear throughout.
- Rilegato
Da: INDOO, Avenel, NJ, U.S.A.INDOO
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 138,93
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Brand New.
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 167,13
EUR 2,31 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New.
- Rilegato
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 169,52
Spedizione gratuitaSpedito in U.S.A.Quantità: 13 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 167,42
EUR 8,96 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 13 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 162,10
EUR 11,00 spedizioneSpedito da Italia a U.S.A.Quantità: 13 disponibili
Condizione: new.
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 177,43
EUR 2,31 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 167,40
EUR 17,61 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 16 disponibili
Condizione: New.
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 177,25
EUR 17,61 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 16 disponibili
Condizione: As New. Unread book in perfect condition.
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 181,25
EUR 17,61 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock.
- Rilegato
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 221,14
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
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.
- Rilegato
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 222,56
EUR 14,79 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. New copy - Usually dispatched within 4 working days.
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 281,28
EUR 17,61 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 528 pages. 9.41x6.38x1.46 inches. In Stock.
- Rilegato
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 291,46
EUR 66,28 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. 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 finit…ely 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.
