I refer to Greenberg's wonderful 2010 MAA article "[Old and new results in the foundations of elementary plane Euclidean and non-Euclidean geometries](https://www.maa.org/sites/default/files/pdf/upload_library/22/Ford/Greenberg2011.pdf)". There, and in [his book](http://rads.stackoverflow.com/amzn/click/0716799480), Greenberg defines a **Hilbert plane** as a model of the 13 Hilbert's first-order axioms of plane geometry. 



> 
> How many elementary equivalence classes of Hilbert planes are there? 
> 
> 
> 


Recall that two Hilbert planes are *elementarily equivalent* if they satisfy the same first-order sentences.


A rough estimate from scanning through Greenberg's is that there are at least $10$ elementary equivalence classes. For example, among Euclidean planes, Greenberg already lists two other elementary equivalence classes: namely semi-Euclidean planes (where the angles in each triangle sum to two right angles) and Pythagorean planes (in which right-angled satisfy the Pythagorean identity). 


Sorting out this zoo of plane geometries would profit from the joint effort of many mathematicians. Polymath, maybe?



Reverse plane geometry, anyone?
There are exactly $2^{\aleph\_0}$ elementary equivalence classes of Hilbert planes.


Let $P$ be a subset of the set of odd primes. Let $K\_P$ be the smallest field extension of $\mathbb{Q}(\{2^{1/p}:p \in P\})$ in $\mathbb{R}$ that is closed under taking square roots of positive elements, and let $H\_P$ be the plane $K\_P^2$. For each odd prime $p$, there is a first-order sentence $S\_p$ expressing the existence of a sequence of $p+1$ line segments whose lengths form a geometric progression such that the last segment is twice as long as the first; it holds in $K\_P^2$ if and only if $2^{1/p} \in K\_P$, which by degree considerations is equivalent to $p \in P$. Thus for subsets $P$ and $Q$ of the set of odd primes, $H\_P$ and $H\_Q$ are elementarily equivalent if and only if $P=Q$. The number of choices for $P$ is $2^{\aleph\_0}$.


On the other hand, there are only countably many first-order sentences, and the number of elementary equivalence classes is at most the number of subsets of the set of first-order sentences, so there are at most $2^{\aleph\_0}$ elementary equivalence classes.


