10 research outputs found
Comparing axiomatizations of free pseudospaces
Independently and pursuing different aims, Hrushovski and Srour (On stable non-equational theories. Unpublished manuscript, 1989) and Baudisch and Pillay (J Symb Log 65(1):443–460, 2000) have introduced two free pseudospaces that generalize the well know concept of Lachlan’s free pseudoplane. In this paper we investigate the relationship between these free pseudospaces, proving in particular, that the pseudospace of Baudisch and Pillay is a reduct of the pseudospace of Hrushovski and Srour
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability requirements. It enables deciding sentences of such theories with arbitrary existential quantification, conjunction and a fixed number of negation symbols in polynomial time. It was recently shown by Nguyen and Pak [SIAM J. Comput. 51(2): 1-31 (2022)] that an even more restricted such fragment of Presburger arithmetic (the first-order theory of the integers with addition and order) is NP-hard. In contrast, by application of our framework, we show that the fixed negation fragment of weak Presburger arithmetic, which drops the order relation from Presburger arithmetic in favour of equality, is decidable in polynomial time
A model theoretic study of right-angled buildings
We study the model theory of countable right-angled buildings with infinite
residues. For every Coxeter graph we obtain a complete theory with a natural
axiomatisation, which is -stable and equational. Furthermore, we
provide sharp lower and upper bounds for its degree of ampleness, computed
exclusively in terms of the associated Coxeter graph. This generalises and
provides an alternative treatment of the free pseudospace.Comment: A number of small typos found by typesetter correcte
Expansions géométriques et ampleur
The main result of this thesis is the study of how ampleness grows in geometric and SU-rank omega structures when adding a new independent dense/codense subset. In another direction, we explore relations of ampleness with equational theories; there, we give a direct proof of the equationality of certain CM-trivial theories. Finally, we study indiscernible closed sets—which are closely related with equations—and measure their complexity in the free pseudoplaneLe résultat principal de cette thèse est l'étude de l'ampleur dans des expansions des structures géométriques et de SU-rang oméga par un prédicat dense/codense indépendant. De plus, nous étudions le rapport entre l'ampleur et l'équationalite, donnant une preuve directe de l'équationalite de certaines théories CM-triviales. Enfin, nous considérons la topologie indiscernable et son lien avec l'équationalite et calculons la complexité indiscernable du pseudoplan libr
A Note on Equational Theories
this paper is to clarify definitions and to show that equationality is a rather robust concept. 2 Definition