Related papers: Positive model theory of interpretations
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
We investigate different set-theoretic constructions in Residuated Logic based on Fitting's work on Intuitionistic Set Theory. We start by stating some results concerning constructible sets within valued models of Set Theory. We present two…
As part of the study of correspondence functors, the present paper investigates their tensor product and proves some of its main properties. In particular, the correspondence functor associated to a finite lattice has the structure of a…
We propose a conjectural extension to positive characteristic case of a well known Deligne's theorem on the existence of super fiber functors. We prove our conjecture in the special case of semisimple categories with finitely many…
The fundamental invariants for vector ODEs of order $\ge 3$ considered up to point transformations consist of generalized Wilczynski invariants and C-class invariants. An ODE of C-class is characterized by the vanishing of the former. For…
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated…
We provide a new proof of the rational splitting of excisive endofunctors of spectra as a product of their homogeneous layers independent of rational Tate vanishing. We utilise the analogy between endofunctors of spectra and equivariant…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
We introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
Model sets (also called cut and project sets) are generalizations of lattices. Here we show how the self-similarities of model sets are a natural replacement for the group of translations of a lattice. This leads us to the concept of…
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
We prove some semipositivity theorems for singular varieties coming from graded polarizable admissible variations of mixed Hodge structure. As an application, we obtain that the moduli functor of stable varieties is semipositive in the…
Computational materials design often profits from the fact that some complicated contributions are not calculated for the real material, but replaced by results of models. We turn this approximation into a very general and in principle…
We prove the basic properties of determinantal semi-invariants for presentation spaces over any finite dimensional hereditary algebra over any field. These include the virtual generic decomposition theorem, stability theorem and the…
The ability to cast values between related types is a leitmotiv of many flavors of dependent type theory, such as observational type theories, subtyping, or cast calculi for gradual typing. These casts all exhibit a common structural…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
We study a number of categorical quasi-uniform structures induced by functors. We depart from a category $\mathcal{C}$ with a proper $(\mathcal{E}, \mathcal{M})$-factorization system, then define the continuity of a $\mathcal{C}$-morphism…