Related papers: Axiomatizing Origami planes

In the proof of Lemma 2.6 (2) the iteration of the map {\tau} was not performed properly and in fact the lemma is wrong; a counterexample is given by f = \bar{x}_1and k = 2. This error does not, however, affect the geometric…

Not any geometry can be axiomatized. The paradoxical Godel's theorem starts from the supposition that any geometry can be axiomatized and goes to the result, that not any geometry can be axiomatized. One considers example of two close…

We review principal results on axiomatizability of classes of lattices of equivalences

Dependence logic, introduced in [8], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the…

This expository paper treats the model theory of probability spaces using the framework of continuous $[0,1]$-valued first order logic. The metric structures discussed, which we call probability algebras, are obtained from probability…

Our main theorem describes the degree 0 cohomology of Igusa varieties in terms of one-dimensional automorphic representations in the setup of mod p Hodge-type Shimura varieties with hyperspecial level at p, mirroring the well known analogue…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

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 resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…

Prompted by results of Guardo, Van Tuyl and the second author for lines in projective 3 space, we develop asymptotic upper bounds for the least degree of a homogeneous form vanishing to order at least m on a union of disjoint r dimensional…

Given a complete and (locally) cartesian closed category U, it is shown that the category of functors from the category of Weil algebras to the category U is (locally, resp.) cartesian closed. The corresponding axiomatization for…

Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded…

Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.

We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

We present a complete algebraic description of the field of first-order joint projective invariants for configurations of \( n \) points in the plane, under the natural diagonal action of the projective group \( PGL(3,\mathbb{R}) \). For \(…

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

We give an upper bound on the number of rational points of an arbitrary Zariski closed subset of a projective space over a finite field. This bound depends only on the dimensions and degrees of the irreducible components and holds for very…

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…