The equational theory of (N, 0, 1, +, ×, ↑) is decidable, but not finitely axiomatisable
Saved in:
Published in | Lecture notes in computer science pp. 240 - 256 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
Berlin
Springer
2005
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
ISBN: | 9783540252368 3540252363 |
---|---|
ISSN: | 0302-9743 1611-3349 |