Related papers: KF, PKF, and Reinhardt's Program

Reasoning about program correctness has been a central topic in static analysis for many years, with Hoare logic (HL) playing an important role. The key notions in HL are partial and total correctness. Both require that program executions…

This paper presents a close form solution in Reproducing Kernel Hilbert Space (RKHS) for the famed Wiener filter, which we called the functional Wiener filter(FWF). Instead of using the Wiener-Hopf factorization theory, here we define a new…

The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…

A fractional generalization of the Floquet theorem is suggested for fractional Schr\"odinger equations (FTSE)s with the time-dependent periodic Hamiltonians. The obtained result, called the fractional Floquet theorem (fFT), is formulated in…

The one-sided and full Hilbert transforms are evaluated exactly by means of the method of finite-part integration [E.A. Galapon, \textit{Proc. Roy. Soc. A} \textbf{473}, 20160567 (2017)]. In general, the result consists of two terms -- the…

A convenient technique for proving kernel theorems for (LF)-spaces (countable inductive limits of Frechet spaces)is developed. The proposed approach is based on introducing a suitable modification of the functor of the completed inductive…

We explore the connection between Hilbertian metrics and positive definite kernels on the real line. In particular, we look at a well-known characterization of translation invariant Hilbertian metrics on the real line by von Neumann and…

Counterfactual examples are widely used in natural language processing (NLP) as valuable data to improve models, and in explainable artificial intelligence (XAI) to understand model behavior. The automated generation of counterfactual…

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

One hundred years after the creation of quantum theory, there is no consensus on the kind of reality that is described by the theory. Here, I attribute the lack of progress to the prevailing interpretative methodology, which invariably…

This paper analyses a Kirchhoff type quasilinear space-time fractional integro-differential equation with memory $(\mathcal{K}^{s}_{\alpha})$. Various a priori bounds are derived in different norms on the solution of the considered…

Despite advancements in large language models (LLMs), non-factual responses still persist in fact-seeking question answering. Unlike extensive studies on post-hoc detection of these responses, this work studies non-factuality prediction…

Generalizations and variations of the fundamental lemma by Willems et al. are an active topic of recent research. In this note, we explore and formalize the links between kernel regression and some known nonlinear extensions of the…

We give simple linear algebraic proofs of Eynard-Mehta theorem, Okounkov-Reshetikhin formula for the correlation kernel of the Schur process, and Pfaffian analogs of these results. We also discuss certain general properties of the spaces of…

This note is a critical examination of the argument of Frauchiger and Renner (Nature Communications 9:3711 (2018)), in which they claim to show that three reasonable assumptions about the use of quantum mechanics jointly lead to a…

Defeasible conditionals are a form of non-monotonic inference which enable the expression of statements like "if $\phi$ then normally $\psi$". The KLM framework defines a semantics for the propositional case of defeasible conditionals by…

We exploit knowledge of linear substructure in the linear-regression Kalman filters (LRKFs) to simplify the problem of moment matching. The theoretical results yield quantifiable and significant computational speedups at no cost of…

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

Artificial neural networks (ANNs) are widely used in modeling sentence processing but often exhibit deterministic behavior, contrasting with human sentence comprehension, which manages uncertainty during ambiguous or unexpected inputs. This…

The f(T) theory, a generally modified teleparallel gravity, has been proposed as an alternative gravity model to account for the dark energy phenomena. Following our previous work [Xin-he Meng and Ying-bin Wang, EPJC(2011),…