相关论文: Trace definability II: model-theoretic linearity

We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for several fragments of second-order HyperLTL, which extends HyperLTL with quantification over sets of traces: they are all in the analytical…

We study the definability of maximal towers and of inextendible linearly ordered towers (ilt's), a notion that is more general than that of a maximal tower. We show that there is, in the constructible universe, a $\Pi^1_1$ definable maximal…

A difference matrix over a group is a discrete structure that is intimately related to many other combinatorial designs, including mutually orthogonal Latin squares, orthogonal arrays, and transversal designs. Interest in constructing…

We prove that an infinite field interpretable in a $p$-adically closed field $K$ is definably isomorphic to a finite extension of $K$. The result remains true in any $P$-minimal field where definable functions are generically…

This thesis is devoted to the study of the interactions existing between the algebraic structure of locally compact groups and the properties of their continuous unitary representations, with a special emphasis on the Type I groups. On the…

We define a global rank for partial types based in a generalization of Shelah trees. We prove an equivalence with the depth of a localized version of the constructions known as dividing sequence and dividing chain. This rank characterizes…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

The field of implicit complexity has recently produced several bounded-complexity programming languages. This kind of language allows to implement exactly the functions belonging to a certain complexity class. We here present a…

We show that, for a certain large class of power-bounded $o$-minimal $\mathcal{L}_T$-theories $T$ whose field of exponents is infinite-dimensional as a vector space over the rationals, any definable set in a $T$-convex valued field…

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

In this paper we give an explicit characterization of o-minimal structures with definable Skolem functions/definable choice. Such structures are, after naming finitely many elements from the prime model, a union of finitely many trivial…

Let $\mathcal{P}$ be the set of points of a finite-dimensional projective space over a local field $F$, endowed with the topology $\tau$ naturally induced from the canonical topology of $F$. Intuitively, continuous incidence abelian group…

In "On o-minimal homotopy groups", o-minimal homotopy was developed for the definable category, proving o-minimal versions of the Hurewicz theorems and the Whitehead theorem. Here, we extend these results to the category of locally…

Let $ M_0 $ denote either the field structure $ \mathbb{Q}_p $ of $ p $-adic numbers, or an $o$-minimal expansion of the field structure $ \mathbb{R} $ of real numbers. We investigate the minimal flows and Ellis groups of definable groups…

We model the process of human full interpretation of object images, namely the ability to identify and localize all semantic features and parts that are recognized by human observers. The task is approached by dividing the interpretation of…

Fix a language L extending the language of real closed fields by at least one new predicate or function symbol. Call an L-structure R pseudo-o-minimal if it is (elementarily equivalent to) an ultraproduct of o-minimal structures. We show…

A theorem of Elekes and Szab\'{o} recognizes algebraic groups among certain complex algebraic varieties with maximal size intersections with finite grids. We establish a generalization to relations of any arity and dimension, definable in:…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

In this paper we consider the classification of minimal cellular structures of spaces of topological complexity two under some hypotheses on there graded cohomological algebra. This continues the method used by M.Grant et al. in [1].

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…