2000 character limit reached
Equations for formally real meadows
Published 18 Oct 2013 in math.RA and cs.LO | (1310.5011v4)
Abstract: We consider the signatures $\Sigma_m=(0,1,-,+, \cdot, \ {-1})$ of meadows and $(\Sigma_m, {\mathbf s})$ of signed meadows. We give two complete axiomatizations of the equational theories of the real numbers with respect to these signatures. In the first case, we extend the axiomatization of zero-totalized fields by a single axiom scheme expressing formal realness; the second axiomatization presupposes an ordering. We apply these completeness results in order to obtain complete axiomatizations of the complex numbers.
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.