Related papers: Can one design a geometry engine? On the (un)decid…
We provide a variant of an axiomatization of elementary geometry based on logical axioms in the spirit of Huzita--Justin axioms for the Origami constructions. We isolate the fragments corresponding to natural classes of Origami…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
In [arXiv:1405.6274, Question 5.2 & Question 5.3] Aschenbrenner, Friedl and Wilton ask: (1) Is the equation problem solvable for the fundamental group of any $3$-manifold? and (2) Is the first-order theory of the fundamental group of any…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of…
For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…
We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature $(\lor,\perp,0,1)$, where `$\perp$' is the orthogonality relation. Our main result is that already its quasi-identities are undecidable:…
In Part 1 of this study we showed, for a wide range of geometries, that the relationships between their concept-sets are fully determined by those between their (affine) automorphism groups. In this (self-contained) part, we show how this…
In this work we propose a notion of genus in the context of Zariski geometries and we obtain natural generalizations of the Riemann--Hurwitz Theorem and the Hurwitz Theorem in the context of very ample Zariski geometries. As a corollary, we…
A. Tarski uses in his system for the elementary geometry only the primitive concept of point, and the two primitive relations betweenness and equidistance. Another approach is the relations to be on lines instead of points. W.…
We use Herbrand's theorem to give a new proof that Euclid's parallel axiom is not derivable from the other axioms of first-order Euclidean geometry. Previous proofs involve constructing models of non-Euclidean geometry. This proof uses a…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
We define the simplest log-euclidean geometry. This geometry exposes a difficulty hidden in Hilbert's list of axioms presented in his "Grundlagen der Geometrie". The list of axioms appears to be incomplete if the foundations of geometry are…
We present alternative postulates for Euclidean geometry whose merit is that they lead to a new class of invariants and associated geometries for real finite-dimensional unital associative algebras.