Related papers: Bar Recursion and Products of Selection Functions

During the last twenty years or so a wide range of realizability interpretations of classical analysis have been developed. In many cases, these are achieved by extending the base interpreting system of primitive recursive functionals with…

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 use G\"{o}del's Dialectica interpretation to produce a computational version of the well known proof of Ramsey's theorem by Erd\H{o}s and Rado. Our proof makes use of the product of selection functions, which forms an intuitive…

We introduce a new, demand-driven variant of Spector's bar recursion in the spirit of the Berardi-Bezem-Coquand functional. The recursion takes place over finite partial functions $u$, where the control parameter $\varphi$, used in…

We introduce and study the definition, main properties and applications of iterated twisted tensor products of algebras, motivated by the problem of defining a suitable representative for the product of spaces in noncommutative geometry. We…

This paper considers a generalisation of selection functions over an arbitrary strong monad $T$, as functionals of type $J^T_R X = (X \to R) \to T X$. It is assumed throughout that $R$ is a $T$-algebra. We show that $J^T_R$ is also a strong…

This paper is about the bar recursion operator in the context of classical realizability. After the pioneering work of Berardi, Bezem & Coquand [1], T. Streicher has shown [10], by means of their bar recursion operator, that the…

We show that the bar recursion operators of Spector and Kohlenbach, considered as third-order functionals acting on total arguments, are not computable in Goedel's System T plus minimization, which we show to be equivalent to a programming…

It is well-known that the tensor product of two bialgebras constitutes the binary product in the category of cocommutative bialgebras and morphisms of bialgebras between them. In this paper, we extend this result to triangular bialgebras…

We study the recurrence of the product of n functions, each of which satisfies the same recurrence relation.

We define a "mirror version" of Brzezinski's crossed product and we prove that, under certain circumstances, a Brzezinski crossed product D\otimes_{R, \sigma}V and a mirror version W\bar{\otimes}_{P, \nu}D may be iterated, obtaining an…

We introduce two new binary operations with combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series…

Given a simple recursive function, we show how to extract from it a reversible and an classical iterative part. Those parts can synchronously cooperate under a Producer/Consumer pattern in order to implement the original recursive function.…

The choice titration procedure presents a subject with a repeated choice between a standard option that always provides the same reward and an adjusting option for which the reward schedule is adjusted based on the subjects previous…

We show that it is possible to define a realizability interpretation for the $\Sigma_2$-fragment of classical Analysis using G\"odel's System T only. This supplements a previous result of Schwichtenberg regarding bar recursion at types 0…

Extending Mart\'in Escard\'o's effectful forcing technique, we give a new proof of a well-known result: Brouwer's monotone bar theorem holds for any bar that can be realized by a functional of type $(\mathbb{N} \to \mathbb{N}) \to…

In 1979 Schwichtenberg showed that the System $\text{T}$ definable functionals are closed under a rule-like version Spector's bar recursion of lowest type levels $0$ and $1$. More precisely, if the functional $Y$ which controls the stopping…

We show that products of propositional modal logics containing the logic of reflexive frames T as a factor are embeddable into their single-variable fragments. The proof is a simplified version of the proof, to appear, of a similar result…

For a given twisted cartesian products of simplicial sets, we construct the corresponding twisted tensor product in the sense of Brown, with an explicit twisting function whose formula is simple without using inductions. This is done by…

We introduce a common generalization of the L-R-smash product and twisted tensor product of algebras, under the name L-R-twisted tensor product of algebras. We investigate some properties of this new construction, for instance we prove a…