Related papers: Non-principal ultrafilters, program extraction and…
We present a logical system CFP (Concurrent Fixed Point Logic) from whose proofs one can extract nondeterministic and concurrent programs that are provably total and correct with respect to the proven formula. CFP is an intuitionistic…
We study a class of multi-dimensional non-local conservation laws of the form $\partial_t u = \operatorname{div}^{\Phi} \mathbf{F}(u)$, where the standard local divergence $\operatorname{div}$ of the flux vector $\mathbf{F}(u)$ is replaced…
Let K be a maximal unramified extension of a nonarchimedean local field with arbitrary residual characteristic p. Let G be a reductive group over K which splits over a tamely ramified extension of K. We show that the associated Moy-Prasad…
We define separating properties for normal ultrafilters. We prove that compactness and supercompactness are separable, yet compactness and measurability are not. We describe how to use separating properties in order to elicit distinct…
A divisibility relation on ultrafilters is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also belongs to $\cal G$. After describing the…
We present a logical system CFP (Concurrent Fixed Point Logic) supporting the extraction of nondeterministic and concurrent programs that are provably total and correct. CFP is an intuitionistic first-order logic with inductive and…
We present a new manifestation of G\"odel's second incompleteness theorem and discuss its foundational significance, in particular with respect to Hilbert's program. Specifically, we consider a proper extension of Peano arithmetic…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…
We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the…
This note answers the following question: Is it consistent that for an arbitrary tall summable ideal I_g there exists an I_g-ultrafilter which is not rapid? We show that assuming Martin's Axiom for \sigma-centered posets such ultrafilters…
Automatic differentiation (AD) aims to compute derivatives of user-defined functions, but in Turing-complete languages, this simple specification does not fully capture AD's behavior: AD sometimes disagrees with the true derivative of a…
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this…
We prove that if $A$ is a singular MASA in a II$_1$ factor $M$ and $\omega$ is a free ultrafilter, then for any $x\in M\ominus A$, with $\|x\|\leq 1$, and any $n\geq 2$, there exists a partition of $1$ with projections $p_1, p_2, ...,…
In many scenarios, a state-space model depends on a parameter which needs to be inferred from data. Using stochastic gradient search and the optimal filter (first-order) derivative, the parameter can be estimated online. To analyze the…
We extend some recent results on the differentiability of torsion theories. In particular, we generalize the concept of $(\alpha, \beta)$-derivation to $(\alpha, \beta)$-higher derivation and demonstrate that a filter of a hereditary…
We present an elementary treatment of the Optional Decomposition Theorem for continuous semimartingales and general filtrations. This treatment does not assume the existence of equivalent local martingale measure(s), only that of strictly…
In standard construction of hyperrational numbers using an ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with…
We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…
A simple \(P_\lambda\)-point on a regular cardinal \(\kappa\) is a uniform ultrafilter on \(\kappa\) with a mod-bounded decreasing generating sequence of length \(\lambda\). We prove that if there is a simple $P_\lambda$-point ultrafilter…