Related papers: A Completeness Theorem for "Total Boolean Function…
We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More…
The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of…
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…
In fairly elementary terms this paper presents, and expands upon, a recent result by Garner by which the notion of topologicity of a concrete functor is subsumed under the concept of total cocompleteness of enriched category theory.…
We derive completeness criteria for sequences of functions of the form $% f(x\lambda_{n})$, where $\lambda_{n}$ is the $nth$ zero of a suitably chosen entire function. Using these criteria, we construct systems of nonorthogonal…
We prove that the notion of Drinfeld center defines a functor from the category of indecomposable multi-tensor categories with morphisms given by bimodules to that of braided tensor categories with morphisms given by monoidal bimodules.…
We define instantiational and algorithmic completeness for a formal language. We show that, in the presence of Church's Thesis, an alternative interpretation of Goedelian incompleteness is that Peano Arithmetic is instantiationally…
The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…
The completeness of Gaussians in a Hilbert functional space is established
Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…
The nonlinear geometry of operator spaces has recently started to be investigated. Many notions of nonlinear embeddability have been introduced so far, but, as noticed before by other authors, it was not clear whether they could be…
We propose a unified view of the polarity of functions, that encompasses all specific definitions, generalizes several well-known properties and provides new results. We show that bipolar sets and bipolar functions are isomorphic lattices.…
We link together three themes which had remained separated so far: the Hilbert space properties of the Riemann zeros, the ``dual Poisson formula'' of Duffin-Weinberger (also named by us co-Poisson formula), and the ``Sonine spaces'' of…
In this paper you can explore the application of some notable Boolean-derived methods, namely the Disjunctive Normal Form representation of logic table expansions, and extend them to a real-valued logic model which is able to utilize…
In relational verification, judicious alignment of computational steps facilitates proof of relations between programs using simple relational assertions. Relational Hoare logics (RHL) provide compositional rules that embody various…
In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…
Quantified Boolean logic results from adding operators to Boolean logic for existentially and universally quantifying variables. This extends the reach of Boolean logic by enabling a variety of applications that have been explored over the…
The paper proposes a vector generalization of the basic concepts of the theory of complex variable: the concept of modulus and argument of complex number. The author introduces some generalizations of the notion of holomorphic functions and…
We define an extension of operator-valued positive definite functions from the real or complex setting to topological algebras, and describe their associated reproducing kernel spaces. The case of entire functions is of special interest,…