Free shipping on orders over $49 - Limited time only - T&Cs apply
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $49
Algebraic Techniques : Resolution of Equations in Algebraic Structures - Hassan Aït-Kaci

Algebraic Techniques

Resolution of Equations in Algebraic Structures

By: Hassan Aït-Kaci (Editor), Maurice Nivat (Editor)

eText | 10 May 2014 | Edition Number 1

At a Glance

eText

$89.10

or 4 interest-free payments of $22.27 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
Resolution of Equations in Algebraic Structures: Volume 1, Algebraic Techniques is a collection of papers from the "Colloquium on Resolution of Equations in Algebraic Structures" held in Texas in May 1987. The papers discuss equations and algebraic structures relevant to symbolic computation and to the foundation of programming. One paper discusses the complete lattice of simulation congruences associated with the ground atomic theory of hierarchical specification, retrieving as the lattice's maximum element Milner's strong bisimulation for CCS. Another paper explains algebraic recognizability of subsets of free T-algebras, or equational theories, and covers discrete structures like those of words, terms, finite trees, and finite graphs. One paper proposes a general theory of unification using a category theoretic framework for various substitution systems including classical unification, E-unification, and order-sorted unification. Another paper shows the universality of algebraic equations in computer science. Fixpoint theorems in ordered algebraic structures can be applied in computer science. These theorems, or their variations, include semantics and proof theory, logic programming, as well as efficient strategies for answering recursive queries in deductive data bases. The collection is suitable for programmers, mathematicians, students, and instructors involved in computer science and computer technology.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionMathematicsAlgebra

More in Algebra

Elementary Algebra : Collins College Outlines - Joan Van Glabek

eBOOK

Elementary Algebra

Collins College Outlines

eBook

RRP $8.99

$8.13

10%
OFF
Learn Calculus with Python - Nick McIntyre

eBOOK

Learn Calculus with Python

eBook

RRP $61.72

$49.38

20%
OFF
Coclass graphs of p-groups - Heiko Dietrich

eTEXT

Coclass graphs of p-groups

eText

$229.00

Excursions in Ring Theory - T. Y. Lam

eTEXT

Excursions in Ring Theory

eText

$129.00

This product is categorised by