Related papers: Positive Definability Patterns
Motivated by deformation quantization we consider $^*$-algebras over ordered rings and their deformations: we investigate formal associative deformations compatible with the $^*$-involution and discuss a cohomological description in terms…
The present work re-enacts the classical theory of t-structures reducing the classical definition given in *Faisceaux Pervers* to a rather primitive categorical gadget: suitable reflective factorization systems. This translation is only…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
There are two ways to turn a categorical model for pure quantum theory into one for mixed quantum theory, both resulting in a category of completely positive maps. One has quantum systems as objects, whereas the other also allows classical…
We give a construction of a large first-order definable family of subrings of finitely generated fields $K$ of any characteristic. We deduce that for any such $K$ there exists a first-order sentence $\varphi_K$ characterising $K$ in the…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
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…
We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…
We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…
The classical as well as non commutative Korovkin-type theorems deal with convergence of positive linear maps with respect to modes of convergences such as norm convergence and weak operator convergence. In this article, Korovkin-type…
Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…
The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results in the field of descriptive complexity. In this paper, we…
We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to…
We show that separability and second-countability are first-order properties among topological spaces definable in o-minimal expansions of $(\mathbb{R},<)$. We do so by introducing first-order characterizations -- definable separability and…
We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
Model theoretic internality provides conditions under which the group of automorphisms of a model over a reduct is itself a definable group. In this paper we formulate a categorical analogue of the condition of internality, and prove an…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…