Related papers: Minimum models of second-order set theories
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
The aim of this paper is to find higher order geometrical corrections to the Einstein-Hilbert action that can lead to only second order equations of motion. The metric formalism is used, and static spherically symmetric and…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…
We introduce and develop a categorification of the theory of Real representations of finite groups. In particular, we generalize the categorical character theory of Ganter--Kapranov and Bartlett to the Real setting. Given a Real…
Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…
We introduce a first-order theory $\mathsf{Seq}$ which is mutually interpretable with Robinson's $\mathsf{Q}$. The universe of a standard model for $\mathsf{Seq}$ consists of sequences. We prove that $\mathsf{Seq}$ directly interprets the…
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…
We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…
Recently an orthogonal basis of $\mathcal{W}_N$-algebra (AFLT basis) labeled by $N$-tuple Young diagrams was found in the context of 4D/2D duality. Recursion relations among the basis are summarized in the form of an algebra SH$^c$ which is…
To describe non-equilibrium transport processes in a quantum device with infinite baths, we propose to formulate the problems as a reduced-order problem. Starting with the Liouville-von Neumann equation for the density-matrix, the…
A difficulty in quantum logic is the well-known arbitrariness in choosing a binary operation for conditional among three principal candidates called the Sasaki, the contrapositive Sasaki, and the relevance conditional, mainly chosen from…
We propose a new model reduction framework for problems that exhibit transport phenomena. As in the moving finite element method (MFEM), our method employs time-dependent transformation operators and, especially, generalizes MFEM to…
We compare two methods of proving separable reduction theorems in functional analysis -- the method of rich families and the method of elementary submodels. We show that any result proved using rich families holds also when formulated with…
Let $\beta: S^{2n+1}\to S^{2n+1}$ be a minimal homeomorphism ($n\ge 1$). We show that the crossed product $C(S^{2n+1})\rtimes_{\beta} \Z$ has rational tracial rank at most one. More generally, let $\Omega$ be a connected compact metric…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
Knowledge graph completion (KGC) can be framed as a 3-order binary tensor completion task. Tensor decomposition-based (TDB) models have demonstrated strong performance in KGC. In this paper, we provide a summary of existing TDB models and…