Related papers: Hilbert's epsilon as an Operator of Indefinite Com…
Ibeling et al. (2023). axiomatize increasingly expressive languages of causation and probability, and Mosse et al. (2024) show that reasoning (specifically the satisfiability problem) in each causal language is as difficult, from a…
We study expansions of Hilbert spaces with a bounded normal operator $T$. We axiomatize this theory in a natural language and identify all of its completions. We prove the definability of the adjoint $T^*$ and prove quantifier elimination…
The $\epsilon$-logic (which is called $\epsilon$E-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the $\forall x$…
The classical Hilbert space formulation of the axioms of Quantum Mechanics appears to leave open the question whether the Hermitian operators which are associated with the observables of a finite non-relativistic quantum system are uniquely…
This paper presents a novel semantics for a quantum programming language by operator algebras, which are known to give a formulation for quantum theory that is alternative to the one by Hilbert spaces. We show that the opposite category of…
The emergence of large-language models (LLMs) has enabled a new class of semantic data processing systems (SDPSs) to support declarative queries against unstructured documents. Existing SDPSs are, however, lacking a unified algebraic…
This paper is a contribution to the theory of dynamical sampling. Our purpose is twofold. We first consider representations of sequences in a Hilbert space in terms of iterated actions of a bounded linear operator. This generalizes recent…
It is often claimed that Bayesian methods, in particular Bayes factor methods for hypothesis testing, can deal with optional stopping. We first give an overview, using elementary probability theory, of three different mathematical meanings…
Supervenience is an important philosophical concept. In this paper, inspired by the supervenience-determined consequence relation and the semantics of agreement operator, we introduce a modal logic of supervenience, which has a dyadic…
We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from…
Capturing the meaning of sentences has long been a challenging task. Current models tend to apply linear combinations of word features to conduct semantic composition for bigger-granularity units e.g. phrases, sentences, and documents.…
The paper discusses the problem of determinising finite-state automata containing large numbers of epsilon-moves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very…
Large language models (LLMs) often generate natural language rationales -- free-form explanations that help improve performance on complex reasoning tasks and enhance interpretability for human users. However, evaluating these rationales…
Let $H_1,H_2$ be complex Hilbert spaces and $T$ be a densely defined closed linear operator (not necessarily bounded). It is proved that for each $\epsilon>0$, there exists a bounded operator $S$ with $\|S\|\leq \epsilon$ such that $T+S$ is…
Quantum mechanics is formulated on a Hilbert space that is assumed to be separable. However, there seems to be no clear reason justifying this assumption. Does it have physical implications? We answer in the positive by proposing a test…
We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft constraints (such as Anglican, Church, and Venture). We define a metalanguage (an…
We study the typical behavior of bounded linear operators on infinite dimensional complex separable Hilbert spaces in the norm, strong-star, strong, weak polynomial and weak topologies. In particular, we investigate typical spectral…
Probabilistic programming languages rely fundamentally on some notion of sampling, and this is doubly true for probabilistic programming languages which perform Bayesian inference using Monte Carlo techniques. Verifying samplers - proving…
Recently, Bansah and Sehba studied in [3] the boundedness of a family of Hilbert-type integral operators, where they characterized the $L^{p}-L^{q}$ boundedness of the operators for $1\leq p\leq q\leq \infty$. In this paper, we deal with…
In the recent advances of natural language processing, the scale of the state-of-the-art models and datasets is usually extensive, which challenges the application of sample-based explanation methods in many aspects, such as explanation…