相关论文: Universal (and Existential) Nulls

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…

Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…

Unextendible product bases (UPBs) are interesting mathematical objects arising in composite Hilbert spaces that have found various applications in quantum information theory, for instance in a construction of bound entangled states or Bell…

The goal of this article is to parametrise solutions to Einstein's equations with big bang singularities and quiescent asymptotics. To this end, we introduce a notion of initial data on big bang singularities and conjecture that it can be…

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…

Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering. In this paper, we prove that disjunctive embedded dependencies exactly…

Many practical scenarios make it necessary to evaluate top-k queries over data items with partially unknown values. This paper considers a setting where the values are taken from a numerical domain, and where some partial order constraints…

In recent years, progress toward the classification of superintegrable systems with higher order integrals of motion has been made. In particular, a complete classification of all exotic potentials with a third or a fourth order integrals,…

In this paper we consider a notion of universal sets for ideals. We show that there exist universal sets of minimal Borel complexity for classic ideals like null subsets of $2^\omega$ and meager subsets of any Polish space, and demonstrate…

The aim of this paper is to extend the structure theory for infinitely generated modules over tame hereditary algebras to the more general case of modules over concealed canonical algebras. Using tilting, we may assume that we deal with…

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…

In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using $O(n^2)$ words and can be used to answer a multiplication query in constant time. It is…

In his remarkable paper Formalism64, Robinson defends his philsophocal position as follows: (i) Any mention of infinite totalities is literally meaningless. (ii) We should act as if infinite totalities really existed. Being the originator…

We make use of an improved existence result for the characteristic initial value problem for the conformal Einstein equations to show that given initial data on two null hypersurfaces $\mathcal{N}_\star$ and $\mathcal{N}'_\star$ such that…

From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from Database Dependency theory. Next, we leverage…

Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…

Existential rules form an expressive Datalog-based language to specify ontological knowledge. The presence of existential quantification in rule-heads, however, makes the main reasoning tasks undecidable. To overcome this limitation, in the…