BN Homepage Two-Image carousal

!

Javascript is not enabled in your browser. Enabling JavaScript in your browser will allow you to experience all the features of our site.

Learn how to enable JavaScript on your browser

Computational Aspects of an Order-Sorted Logic with Term Declarations

Computational Aspects of an Order-Sorted Logic with Term Declarations

Add to Wishlist

Computational Aspects of an Order-Sorted Logic with Term Declarations

Paperback(1989)

$49.99

Paperback(1989)
$49.99

SHIP THIS ITEM

In stock. Ships in 6-10 days.
PICK UP IN STORE

Your local store may have stock of this item.

Available within 2 business hours

Want it Today?
Check Store Availability

Related collections and offers

Product Details
Table of Contents

Product Details

ISBN-13:	9783540517054
Publisher:	Springer Berlin Heidelberg
Publication date:	11/01/1989
Series:	Lecture Notes in Computer Science , #395
Edition description:	1989
Pages:	174
Product dimensions:	6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

Foundations.- Various extensions.- Unification of uninterpreted sorted terms.- Unification of equationally interpreted sorted terms.- Sorted resolution-based calculi.- References.

From the B&N Reads Blog

Page 1 of

Customer Reviews