𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colloquim on algebra, combinatorics and logic in computer science

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
42 KB
Volume
44
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

September 12-16, 1983; at Gy6r, Hungary 'The J~nos Bolyai Mathematical Society intends to organize a "Colloquium on Algebra, Combinatorics and Logic in Computer Science" in the period 12-16, September 1983 at GySr (Hungary). The aim of the colloquium is to provide ground for the exchange of information on new achievements and the recent problems in any field of algebra, combinatorics and logic related to: the theory of automata, tree automata, computation and languages, semantics, complexity, computability, decidability, data structures, data w_anipulatio, and data analysis. Other fields of computer science applying algebra, combinatorics and logic are also welcome.

The Organizing Committee consists of M.

πŸ“œ SIMILAR VOLUMES

On Coherence in Computer Algebra
On Coherence in Computer Algebra
✍ Andreas Weber πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 435 KB

Modern computer algebra systems (e.g. AXIOM) support a rich type system including parameterized data types and the possibility of implicit coercions between types. In such a type system it will be frequently the case that there are different ways of building coercions between types. An important req

Equality in Computer Algebra and Beyond
Equality in Computer Algebra and Beyond
✍ James H Davenport πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 284 KB

Equality is such a fundamental concept in mathematics that, in fact, we seldom explore it in detail, and tend to regard it as trivial. When it is shown to be non-trivial, we are often surprised. As is often the case, the computerization of mathematical computation in computer algebra systems on the