Skip to main content
http -> https (the question was bumped anyway)
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

For fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings - as I mentioned here in a recent post. Many years ago Stan Burris told me that John Lawrence discovered such an equational proof that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if the proof is published yet, but some clues as to how it may proceed might be gleaned from their earlier joint [work [1]] 11

11 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

For fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings - as I mentioned here in a recent post. Many years ago Stan Burris told me that John Lawrence discovered such an equational proof that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if the proof is published yet, but some clues as to how it may proceed might be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

For fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings - as I mentioned here in a recent post. Many years ago Stan Burris told me that John Lawrence discovered such an equational proof that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if the proof is published yet, but some clues as to how it may proceed might be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link

For fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings - as I mentioned here in a recent postpost. Many years ago Stan Burris told me that John Lawrence discovered such an equational proof that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if the proof is published yet, but some clues as to how it may proceed might be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

For fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings - as I mentioned here in a recent post. Many years ago Stan Burris told me that John Lawrence discovered such an equational proof that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if the proof is published yet, but some clues as to how it may proceed might be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

For fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings - as I mentioned here in a recent post. Many years ago Stan Burris told me that John Lawrence discovered such an equational proof that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if the proof is published yet, but some clues as to how it may proceed might be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

added 115 characters in body; added 2 characters in body
Source Link
Bill Dubuque
  • 4.7k
  • 2
  • 36
  • 33

ThatFor fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings follows from Birkhoff's completeness theorem,- as I mentioned here in a recent recentlypost. Many years ago Stan Burris told me many years ago that John Lawrence has discovered such an equational proof, but that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if it has beenthe proof is published yet. Some, but some clues as to how it may proceed maymight be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

That such a proof must exist in the first-order equational theory of rings follows from Birkhoff's completeness theorem, as I mentioned here recently. Stan Burris told me many years ago that John Lawrence has discovered such an equational proof, but I don't know if it has been published yet. Some clues as to how it may proceed may be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

For fixed $n \in \mathbb{N}$, Birkhoff's completeness theorem implies that such a proof must exist in the first-order equational theory of rings - as I mentioned here in a recent post. Many years ago Stan Burris told me that John Lawrence discovered such an equational proof that works uniformly for all $n$ (possibly also for Jacobson's form $x^{n(x)} = x$). I don't know if the proof is published yet, but some clues as to how it may proceed might be gleaned from their earlier joint [work [1]] 1

1 S. Burris and J. Lawrence, Term rewrite rules for finite fields.
International J. Algebra and Computation 1 (1991), 353-369. http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/fields3.pdf

Source Link
Bill Dubuque
  • 4.7k
  • 2
  • 36
  • 33
Loading