Related papers: Constructibility real degrees in the side-by-side …
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
In this paper it is shown that the class $\mathcal{PCSL}^{ec}$ of existentially closed pseudocomplemented semilattices is finitely axiomatizable by appropriately extending the finite axiomatization of the class…
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck…
For any integral lattice $Q$, one can construct a vertex algebra $V_Q$ called a lattice vertex algebra. If $\sigma$ is an automorphism of $Q$ of finite order, it can be lifted to an automorphism of $V_Q$. In this paper we classify the…
The set of points of a one-dimensional cut-and-project quasicrystal or model set, while not additive, is shown to be multiplicative for appropriate choices of acceptance windows. This leads to the definition of an associative additive…
Concrete semi-realistic string/M theory constructions often predict the existence of new physics at the TeV scale, which may be different in character from the bottom-up ideas that are motivated by specific problems of the standard model. I…
Let A be a commutative ring, B a commutative A-algebra and M a complex of B-modules. We begin by constructing the square Sq_{B/A} M, which is also a complex of B-modules. The squaring operation is a quadratic functor, and its construction…
We study the model theoretic strength of various lattices that occur naturally in topology, like closed (semi-linear or semi-algebraic or convex) sets. The method is based on weak monadic second order logic and sharpens previous results by…
This work studies the proof theory of left (right) skew monoidal closed categories and skew monoidal bi-closed categories from the perspective of non-associative Lambek calculus. Skew monoidal closed categories represent a relaxed version…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…
We present a categorical relationship between iterated $S^3$ Sasaki-joins and Bott orbifolds. Then we show how to construct smooth Sasaki-Einstein (SE) structures on the iterated joins. These become increasingly complicated as dimension…
We study the large scale geometry of mapping class groups MCG(S), using hyperbolicity properties of curve complexes. We show that any self quasi-isometry of MCG(S) (outside a few sporadic cases) is a bounded distance away from a…
We describe the structure of module categories of finite dimensional algebras over an algebraically closed field for which the cycles of nonzero nonisomorphisms between indecomposable finite dimensional modules are finite (do not belong to…
We give a fully constructive proof that there is a proper cartesian $\omega$-combinatorial model structure on the category of simplicial sets, whose generating cofibrations and trivial cofibrations are the usual boundary inclusion and horn…
We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently,…
In the present paper we use the theory of exact completions to study categorical properties of small setoids in Martin-L\"of type theory and, more generally, of models of the Constructive Elementary Theory of the Category of Sets, in terms…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and {\it twisted} versions of conventional supersymmetric sigma models with N=2…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…