相关论文: Completions of Kleene's second model
We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg's theorem: "there are 2^2^kappa many maximal (=precomplete)…
In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…
It is shown that universal algebras that are injective in their equational classes are characterized by internal property that can be called completeness. We define universal algebra $A$ as complete (closed to simple extensions) if for each…
A cardinal kappa is countably closed if mu^omega < kappa whenever mu < kappa. Assume that there is no inner model with a Woodin cardinal and that every set has a sharp. Let K be the core model. Assume that kappa is a countably closed…
Despite the popularity of low-rank matrix completion, the majority of its theory has been developed under the assumption of random observation patterns, whereas very little is known about the practically relevant case of non-random…
We show that some recent constructions in the literature, named `weak' generalizations, can be systematically treated by passing from 2-categories to categories enriched in the Cartesian monoidal category of Cauchy complete categories.
For a connected reductive group $G_k$ over an algebraically closed field $k$ of char $\neq 2$ and a fixed point subgroup $K_k$ under an algebraic group involution, we construct a quantization and an integral model of any affine embeddings…
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later and more recent work investigated intensional…
We introduce ($\ell$-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially ordered (lattice-ordered) set. Bimonoids form an appropriate framework for the study of a general notion of complementation,…
We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…
We investigate wether three statements in analysis, that can be proved classically, are realizable in the realizability model of extensional continuous functionals induced by Kleene's second model $K_2$. We prove that a formulation of the…
We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…
We introduce the two substructural propositional logics KL, KL+, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a…
Complete Boolean algebras proved to be an important tool in topology and set theory. Two of the most prominent examples are B(kappa), the algebra of Borel sets modulo measure zero ideal in the generalized Cantor space {0,1}^kappa equipped…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
We give some general criteria, when kappa-complete forcing preserves largeness properties -- like kappa-presaturation of normal ideals on lambda (even when they concentrate on small cofinalities). Then we quite accurately obtain the…
We provide a complete classification of solvable instances of the equational unification problem over De Morgan and Kleene algebras with respect to unification type. The key tool is a combinatorial characterization of finitely generated…
Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…
The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such as linear algebra, optimization, and control theory. This…
In this paper we explore some categorical results of 2-crossed module of commutative algebras extending work of Porter in [18]. We also show that the forgetful functor from the category of 2-crossed modules to the category of k-algebras,…