Related papers: A Completeness Theorem for "Total Boolean Function…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction…
The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…
We begin the study of categorical logic for continuous model theory. In particular, we 1. introduce the notions of metric logical categories and functors as categorical equivalents of a metric theory and interpretations, 2. prove a…
This article explores the concept of absoluteness in the context of mathematical analysis, focusing specifically on the Riemann integral on $\mathbb{R}^{n}$. In mathematical logic, "absoluteness" refers to the invariance of the truth value…
Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and…
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…
We advocate a declarative approach to proving properties of logic programs. Total correctness can be separated into correctness, completeness and clean termination; the latter includes non-floundering. Only clean termination depends on the…
Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and…
We introduce the notions of proto-complete, complete, complete* and strong-complete objects in pointed categories. We show under mild conditions on a pointed exact protomodular category that every proto-complete (respectively complete)…
One of the benefit properties implied by the extensionality axiom of Hilbert's epsilon calculus is that the calculus becomes complete with respect to the choice structures as semantics. Another implication of the axiom, discussed in the…
The goal is to review the notion of a complete Segal space and how certain categorical notions behave in this context. In particular, we study functoriality in complete Segal spaces via fibrations. Then we use it to define limits and…
We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…
Resolving an open question of J. A. Carillo and G. Toscani, M. Stawiska recently proved that certain metric spaces of probability measures equipped with Fourier-based metrics are complete. In this note, we extend such Fourier-based metrics…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
A description of physical reality in which wholeness is the foundation is discussed along with the motivation for such an attempt. As a possible mathematical framework within which a physical theory based on wholeness may be expressed,…
Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…
The goal of the paper is to relate complexity measures associated with the evaluation of Boolean functions (certificate complexity, decision tree complexity) and learning dimensions used to characterize exact learning (teaching dimension,…
This article provides a general framework in the context of category theory where one can recognize as particular instances of the same abstract construction several notions of completion, envelope, and hull, such as the Boolean algebra…