Abstract
In this paper we provide a quantifier‐free constructive axiomatization for Euclidean planes in a first‐order language with only ternary operation symbols and three constant symbols (to be interpreted as ‘points’). We also determine the algorithmic theories of some ‘naturally occurring’ plane geometries. Mathematics Subject Classification: 03F65, 51M05, 51M15, 03B30.
Original language | English (US) |
---|---|
Pages (from-to) | 76-86 |
Number of pages | 11 |
Journal | Mathematical Logic Quarterly |
Volume | 40 |
Issue number | 1 |
DOIs | |
State | Published - 1994 |
Externally published | Yes |
Keywords
- Algorithmic logic
- Constructive axiomatization
- Euclidean planes
ASJC Scopus subject areas
- Logic