A page from the OpenDepot.org service

Jump to the start of the main contents

Anderson, J.A.D.W. and Voelker, N. and Adams, A.A. (2007) Perspex Machine VIII: Axioms of Transreal Arithmetic. In: Vision Geometry XV. Proceedings of SPIE, 6499 . SPIE. ISBN 0-819-46612-9

[img]
Preview
PDF
Download (238Kb) | Preview

    Abstract

    Transreal arithmetic is a total arithmetic that contains real arithmetic, but which has no arithmetical exceptions. It allows the specification of the Universal Perspex Machine which unifies geometry with the Turing Machine. Here we axiomatise the algebraic structure of transreal arithmetic so that it provides a total arithmetic on any appropriate set of numbers. This opens up the possibility of specifying a version of floating-point arithmetic that does not have any arithmetical exceptions and in which every number is a first-class citizen. We find that literal numbers in the axioms are distinct. In other words, the axiomatisation does not require special axioms to force non-triviality. It follows that transreal arithmetic must be defined on a set of numbers that contains {-infinity, -1, 0, 1, infinity, nullity} as a proper subset. We note that the axioms have been shown to be consistent by machine proof.

    Item Type: Book Section
    Subjects: Mathematical and Computer Sciences > Others in Mathematical and Computing Sciences > Mathematical and Computing Sciences not elsewhere classified
    Divisions: UNSPECIFIED
    Depositing User: Dr Andrew Adams
    Date Deposited: 23 Jul 2008 14:24
    Last Modified: 23 Aug 2010 14:26
    URI: http://opendepot.org/id/eprint/83

    Actions (login required)

    View Item