相关论文: A New Proof of P-time Completeness of Linear Lambd…

We present PBLean, a method for importing VeriPB pseudo-Boolean (PB) proof certificates into Lean 4. Key to our approach is reflection: a Boolean checker function whose soundness is fully proved in Lean and executed as compiled native code.…

We provide a self-contained proof to so-called Martio's conjecture in the class of mappings of bounded length distortion. Unlike the earlier proofs, our proof is not based on the modulus of continuity estimate of Martio from 1970.

Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures. With the sole exception of LTL…

We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our…

Consider testing multiple hypotheses in the setting where the p-values of all hypotheses are unknown and thus have to be approximated using Monte Carlo simulations. One class of algorithms published in the literature for this scenario…

We propose a numerical validation of a probabilistic approach applied to estimate the relative accuracy between two Lagrange finite elements $P_k$ and $P_m, (k<m)$. In particular, we show practical cases where finite element $P_{k}$ gives…

Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness…

In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative…

Probabilistic Hoare logic (PHL) is an extension of Hoare logic and is specifically useful in verifying randomized programs. It allows researchers to formally reason about the behavior of programs with stochastic elements, ensuring the…

In this paper, we prove a version of the typed B\"ohm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a…

Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are quantitative extensions of linear temporal logic, which are prominent and widely used in the verification of real-timed systems. It was recently shown that the…

We prove the Martingale Convergence Theorem by using the work of L. Dubins and I. Monroe about embedding a given discrete-time martingale in the sample paths of a Brownian motion.

This is a note on \cite{LSU} and \cite{FS}. Using their work line by line, we prove the H\"older-continuity of solutions to linear parabolic equations of mixed type, assuming the coefficient of $\frac{\partial}{\partial t}$ has…

Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determ- ining provability of bounded depth formulas in the…

In this article, we construct a two-block Gibbs sampler using Polson et al. (2013) data augmentation technique with Polya-Gamma latent variables for Bayesian logistic linear mixed models under proper priors. Furthermore, we prove the…

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

Testing for white noise is a classical yet important problem in statistics, especially for diagnostic checks in time series modeling and linear regression. For high-dimensional time series in the sense that the dimension $p$ is large in…

Probability predictions from binary regressions or machine learning methods ought to be calibrated: If an event is predicted to occur with probability $x$, it should materialize with approximately that frequency, which means that the…

In a recent work [3], the authors established new results about general linear Mahler systems in several variables from the perspective of transcendental number theory, such as a multivariate extension of Nishioka's theorem. Working with…

We prove that certain sequences of Laurent polynomials, obtained from a fixed Laurent polynomial P by monomial substitutions, give rise to sequences of Mahler measures which converge to the Mahler measure of P. This generalizes previous…