Download PDFOpen PDF in browser

A Philosophical Unification of Arithmetics and Electronic Machine.

EasyChair Preprint no. 8691

24 pagesDate: August 21, 2022


This paper investigates the unification of arithmetics by first treating the theorem of One­arithmetical equality with machine philosophy in electronic domain. The theorem is made up of 5 parts just like the computer units. Computer is an electronic machine that has programs for reading, writing and storing in an electronic domain. There are nine(9) questions concerning “What”, “Who”, “Which”,
“Who­ness”, “Which­ness” and “Where­ness” of the One­arithmetical equality and their proof answers in machine concepts. Theorem (4) of the One­arithmetical equality is described in this paper as Division Equality Theorem and it I­V characteristics in memristor array design in memory device. A coin analogy is employed in the teaching of H­O­N system. This paper investigated the person who is involved in the provision of product information and the storage of results in an electronic machine memory –) Computer Memory. It also put forward ways to name and study things as encountered in a computer field matter. The phrase “Who­ness to who” is a call to study a thing
encountered­ Central Processor Unit(CPU), Arithmetic Logic Unit(ALU), Memory Unit(MU), Datapath and Control Units(DCU).
The discovery of Rightus Equalus is verbally proved in this machine paper. The list of claims are provided in the final section of this paper.

Keyphrases: arithmetical, division, electronic machine, Equality, Hon system, machine, mathematical, number  system, parts, proof, signs, unification

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Frank Appiah},
  title = {A Philosophical Unification of Arithmetics and Electronic Machine.},
  howpublished = {EasyChair Preprint no. 8691},

  year = {EasyChair, 2022}}
Download PDFOpen PDF in browser