proof theory general unification von snyder (13 Ergebnisse)

Hardcover. 175 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 0817635939 Sprache: Englisch Gewicht in Gramm: 900.

Hardcover. Zustand: Good. Series: Progress in Computer Science and Applied Logic hardback with purple laminated cover, from a Cambridge college library, hardly used, as new, with obliterated library markings Language: English.

Kartoniert, Format groß 8°, 175 Seiten, dies ist ein regulär ausgesondertes Bibliotheksexemplar aus einer wissenschaftlichen Bibliothek, keine Markierungen / Anstreichungen im Text, das Buch befindet sich in einem tadellosen Zustand --- Hardcover, 175 pages, Lib.Ex., no marks / underlines, the book is in an excellent condition. Shipping to abroad insured with tracking number.

Zustand: New. pp. 192 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

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: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.

Zustand: New. Series: Progress in Computer Science and Applied Logic. Num Pages: 178 pages, biography. BIC Classification: UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 12. Weight in Grams: 449. . 1991. Hardback. . . . . Books ship from the US and Ireland.

Gebunden. Zustand: New.

Zustand: New.

Taschenbuch. Zustand: Neu. A Proof Theory for General Unification | W. Snyder | Taschenbuch | vii | Englisch | 2012 | Birkhäuser | EAN 9781461267584 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig inated by Herbrand and developed in the case of standard first-order unifi cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of 'inference rules' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher order unification from an analysis of the sense in which terms are 'the same' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi cation problems.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig inated by Herbrand and developed in the case of standard first-order unifi cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of 'inference rules' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher order unification from an analysis of the sense in which terms are 'the same' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi cation problems.