SearcharxivSearch

arXiv · 2408.10196

Some model theory of quadratic geometries

Abstract

Orthogonal spaces are vector spaces together with a quadratic form whose associated bilinear form is non-degenerate. Over fields of characteristic two, there are many quadratic forms associated to a given bilinear form and quadratic geometries are structures that encode a vector space over a field of characteristic 2 with a non-degenerate bilinear form together with a space of associated quadratic forms. These structures over finite fields of characteristic 2 form an important part of the basic geometries that appear in the Lie coordinatizable structures of Cherlin and Hrushovski. We (a) describe the respective model companions of the theory of orthogonal spaces and the theory of quadratic geometries and (b) classify the pseudo-finite completions of these theories. We also (c) give a neostability-theoretic classification of the model companions and these pseudo-finite completions. This is a small step towards understanding the analogue of the Cherlin-Hrushovski theory of Lie coordinatizable structures in a setting where the involved fields may be pseudo-finite.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Charlotte Kestner, Nicholas Ramsey. 2024-08-19. Some model theory of quadratic geometries. https://arxiv.org/abs/2408.10196

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO