共 7 条
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness
被引:11
|作者:
Bergstra, Jan A.
[1
]
Tucker, John, V
[2
]
机构:
[1] Univ Amsterdam, Informat Inst, Sci Pk 904, NL-1098 XH Amsterdam, Netherlands
[2] Swansea Univ, Dept Comp Sci, Bay Campus,Fabian Way, Swansea SA1 8EN, W Glam, Wales
关键词:
arithmetic structures;
rational numbers;
division by zero;
meadows;
common meadows;
fracterm calculus;
equational specification;
initial algebra semantics;
FRACTIONS;
D O I:
10.1093/comjnl/bxac026
中图分类号:
TP3 [计算技术、计算机技术];
学科分类号:
0812 ;
摘要:
Common meadows are arithmetic structures with inverse or division, made total on 0 by a flag perpendicular to for ease of calculation. We examine some axiomatizations of common meadows to clarify their relationship with commutative rings and serve different theoretical agendas. A common meadow fracterm calculus is a special form of the equational axiomatization of common meadows, originally based on the use of division on the rational numbers. We study axioms that allow the basic process of simplifying complex expressions involving division. A useful axiomatic extension of the common meadow fracterm calculus imposes the requirement that the characteristic of common meadows be zero (using a simple infinite scheme of closed equations). It is known that these axioms are complete for the full equational theory of common cancellation meadows of characteristic 0. Here, we show that these axioms do not prove all conditional equations which hold in all common cancellation meadows of characteristic 0.
引用
收藏
页码:1565 / 1572
页数:8
相关论文