Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic T-coalgebras that interpret coalgebraic logic which is defined in terms of predicate ...
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
There is a perfect thin 0 1 class whose upward closure in the Turing degrees has full measure (and indeed contains every 2-random degree.) Thus, in the Muchnik lattice of 0 1 class...
Abstract. We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a ...
Abstract. We prove a version of the associated sheaf functor theorem in Algebraic Set Theory. The proof is established working within a Heyting pretopos equipped with a system of s...