Related papers: Bar recursion in classical realisability : depende…
This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…
The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…
We substantially apply the Li criterion for the Riemann hypothesis to hold. Based upon a series representation for the sequence \{\lambda_k\}, which are certain logarithmic derivatives of the Riemann xi function evaluated at unity, we…
This paper is a summary of the general approach outlined in my previous papers toward proving the riemann hypothesis. Numerical and graphical proof of the Riemann Hypothesis is presented with analytical arguments although more work needs…
We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and…
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…
We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness…
Deductive verification of concurrent programs under weak memory has thus far been limited to simple programs over a monolithic state space. For scalabiility, we also require modular techniques with verifiable library abstractions. This…
Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference…
It is widely known that the recursion operator is a very important component of integrability. It allows one to describe in a compact form both hierarchies of the generalized symmetries and infinite series of the local conservation laws. In…
Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…
We study the behaviour on rearrangement-invariant spaces of such classical operators of interest in harmonic analysis as the Hardy-Littlewood maximal operator (including the fractional version), the Hilbert and Stieltjes transforms, and the…
We study an expressive model of timed pushdown automata extended with modular and fractional clock constraints. We show that the binary reachability relation is effectively expressible in hybrid linear arithmetic with a rational and an…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
We study how to infer new choices from previous choices in a conservative manner. To make such inferences, we use the theory of choice functions: a unifying mathematical framework for conservative decision making that allows one to impose…
Recently, we have shown that von Neumann algebras form a model for Selinger and Valiron's quantum lambda calculus. In this paper, we explain our choice of interpretation of the duplicability operator "!" by studying those von Neumann…
Pearl's Causal Hierarchy (PCH) is a central framework for reasoning about probabilistic, interventional, and counterfactual statements, yet the satisfiability problem for PCH formulas is computationally intractable in almost all classical…
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…
Most of this article is an expanded version of our conference talk. It is essentially a survey, but some part, like most of the lengthy Section 5, is comprised of new results whose proofs are unpublished elsewhere. We begin by reviewing the…