Related papers: Bar recursion in classical realisability : depende…
We show that there is a $\beta$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $\Pi^1_2$-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that…
Different constructions in the recursion theory use the so-called priority arguments. A general scheme was suggested by A.~Lachlan. Based on his work, we define the notion of a priority-closed class of requirements. Then, for a specific…
The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of the program. The problem is important for static analysis and is used…
We extend the standard reinforcement learning framework to random time horizons. While the classical setting typically assumes finite and deterministic or infinite runtimes of trajectories, we argue that multiple real-world applications…
We consider pushdown systems that store, instead of a single word, a Mazurkiewicz trace on its stack. These systems are special cases of valence automata over graph monoids and subsume multi-stack systems. We identify a class of such…
Programs with control are usually modeled using lambda calculus extended with control operators. Instead of modifying lambda calculus, we consider a different model of computation. We introduce continuation calculus, or CC, a deterministic…
We develop contractive finite dimensional realizations for rational matrix functions of one variable on domains that are not simply connected, such as the annulus. The proof uses multivariable contractive realization results as well as…
The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability…
This paper introduces Flexible First-Order Stochastic Dominance (FFSD), a mathematically rigorous framework that formalizes Herbert Simon's concept of bounded rationality using the Lean 4 theorem prover. We develop machine-verified proofs…
We conjecture that for a strongly minimal theory T in a finite signature satisfying the Zilber Trichotomy, there are only three possibilities for the recursive spectrum of T: all countable models of T are recursively presentable; none of…
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…
In a recent paper, Herbelin developed a calculus dPA$^\omega$ in which constructive proofs for the axioms of countable and dependent choices could be derived via the encoding of a proof of countable universal quantification as a stream of…
The Rubio de Francia extrapolation theorem is a very powerful result which states that in order to show that certain operators satisfy weighted norm inequalities with Muckenhoupt weights it suffices to see that the corresponding…
We extend Agler's notion of a function algebra defined in terms of test functions to include products, in analogy with the practice in real algebraic geometry, and hence the term preordering in the title. This is done over abstract sets and…
One perspective on quantum algorithms is that they are classical algorithms having access to a special kind of memory with exotic properties. This perspective suggests that, even in the case of quantum algorithms, the control flow notions…
This thesis is devoted to the study of a calculus that describes the application of conditional rewriting rules and the obtained results at the same level of representation. We introduce the rewriting calculus, also called the rho-calculus,…
The CAP theorem asserts a trilemma between consistency, availability, and partition tolerance. This paper introduces a rigorous automata-theoretic and economically grounded framework that reframes the CAP trade-off as a constraint…
The functional equation defining the free cumulants in free probability is lifted successively to the noncommutative Fa\`a di Bruno algebra, and then to the group of a free operad over Schr\"oder trees. This leads to new combinatorial…
The fundamental tension between availability and consistency shapes the design of distributed storage systems. Classical results capture extreme points of this trade-off: the CAP theorem shows that strong models like linearizability…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…