Related papers: Constructive Quantifier Elimination with a Focus o…
Matrix completion is a classical problem in data science wherein one attempts to reconstruct a low-rank matrix while only observing some subset of the entries. Previous authors have phrased this problem as a nuclear norm minimization…
Given a first-order sentence, a model-checking computation tests whether the sentence holds true in a given finite structure. Data provenance extracts from this computation an abstraction of the manner in which its result depends on the…
The simplicity of the induced modules for reductive Lie algebras over an algebraically closed field of positive characteristic is studied, and a necessary and sufficient condition for the simplicity is given.
We define quantum determinants in Quantum Matrix Algebras, related to couples of compatible braidings following the scheme from [G]. We establish relations between these determinants and the so-called column-(row-)determinants, often used…
In this paper, we give appropriate languages in which the theory of tame fields (of any characteristic) admits (relative) quantifier elimination.
The detection and estimation of quantum entanglement are the essential issues in the theory of quantum entanglement. We construct matrices based on the realignment of density matrices and the vectorization of the reduced density matrices,…
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…
We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation…
We use generalized Taylor formulae in order to give some simple constructions in the real closure of an \ovfz. We deduce a new, simple quantifier elimination algorithm for \rcvfs and some theorems about constructible subsets of real…
In this paper, we mainly prove some results on the additivity of maps over rings under certain conditions. First, we discuss a special case of MARTINDALE III's theorem of \cite{1969M} as a bijective map $\varphi$ over a ring $R$ with a…
State explosion problem is the main obstacle of model checking. In this paper, we try to solve this problem from a coalgebraic approach. We establish an effective method to prove uniformly the existence of the smallest Kripke structure with…
By the Telescope Conjecture for Module Categories, we mean the following claim: "Let R be any ring and (A, B) be a hereditary cotorsion pair in Mod-R with A and B closed under direct limits. Then (A, B) is of finite type." We prove a…
In this note, we give a characterization of all projectable and divisible-projectable reduced $f$-rings satisfying the first convexity property and admitting elimination of quantifiers, in the language of lattice-ordered rings with the…
Several authors have introduced various type of coherent-like rings and proved analogous results on these rings. It appears that all these relative coherent rings and all the used techniques can be unified. In [2], several coherent-like…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
In order to extrincate the structure of corings with a finitely generated and projective generator we give the notion of a comatrix coring. As consequences we give generalizations of the main characterizations of faithfully flat Galois…
We obtain sealing by forcing over a self-iterable model. The proof is fine-structure free and uses only basic ideas from iteration theory. We believe that such fine-structure free proofs will make the subject more accessible to the general…
In a Systems Engineering setting, various models are produced using a variety of methods and tools. Focusing on a type of models -- called descriptive models -- which we shall describe, we argue that, while the clarity and precision of…
If $k$ is a field, $A$ and $B$ $k$-algebras, $M$ a faithful left $A$-module, and $N$ a faithful left $B$-module, we recall the proof that the left $A\otimes_k B$-module $M\otimes_k N$ is again faithful. If $k$ is a general commutative ring,…
Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…