A semantic construction of two-ary integers
Author(s) -
Gabriele Ricci
Publication year - 2005
Publication title -
discussiones mathematicae - general algebra and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.127
H-Index - 2
eISSN - 2084-0373
pISSN - 1509-9415
DOI - 10.7151/dmgaa.1099
Subject(s) - mathematics , unary operation , extension (predicate logic) , discrete mathematics , binary tree , integer (computer science) , binary number , algebraic number , quadratic integer , binary operation , combinatorics , algebraic structure , arithmetic , pure mathematics , computer science , mathematical analysis , programming language
To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex. We use a semantic construction to get this extension. This method difiers from the algebraic ones, mainly because it is able to flnd equational features of the extended objects. Two-ary integers turn out to
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom