Bryan Ford

This paper introduces reflective grounded arithmetic (RGA), a paracomplete arithmetic system that permits unconstrained recursive definitions, proves the totality of addition and multiplication, represents recursively enumerable sets, and remains consistent, while occupying a distinct corner between classical and intuitionistic arithmetic.