2000 character limit reached
Signed-Bit Representations of Real Numbers
Published 2 Oct 2015 in math.LO | (1510.00648v1)
Abstract: The signed-bit representation of real numbers is like the binary representation, but in addition to 0 and 1 you can also use -1. It lends itself especially well to the constructive (intuitionistic) theory of the real numbers. The first part of the paper develops and studies the signed-bit equivalents of three common notions of a real number: Dedekind cuts, Cauchy sequences, and regular sequences. This theory is then applied to homomorphisms of Riesz spaces into the reals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.