Related papers: Ordinal analysis of partial combinatory algebras
We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation.…
We study a class of extensions of the k-contracted Poincar\'e algebra under the hipotesis of generalizing the Bargmann algebra and his central charge. As we will see this type of contractions will lead in a natural way to consider the…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
In this present paper, we study geometric structures of rank two prolongations of implicit second-order partial differential equations (PDEs) for two independent and one dependent variables and characterize the type of these PDEs by the…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…
If $\fA$ is a unital weak-$*$ closed algebra of multiplication operators on a reproducing kernel Hilbert space which has the property $\bA_1(1)$, then the cyclic invariant subspaces index a Nevanlinna-Pick family of kernels. This yields an…
We consider varieties generated by finite closure algebras whose canonical relations have two levels, and whose restriction to a level is an "extremal" relation, i.e. the identity or the universal relation. The corresponding logics have…
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean…
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…
The minimal models M(p',p) with p' > 2 have a unique (non-trivial) simple current of conformal dimension h = (p' - 2) (p - 2) / 4. The representation theory of the extended algebra defined by this simple current is investigated in detail.…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
For any pair of ordinals $\alpha<\beta$, $\sf CA_\alpha$ denotes the class of cylindric algebras of dimension $\alpha$, $\sf RCA_{\alpha}$ denote the class of representable $\sf CA_\alpha$s and $\sf Nr_\alpha CA_\beta$ ($\sf Ra CA_\beta)$…
Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition operator, which enables reasoning about concurrent programs. However, CKA fundamentally misses tests, which are needed to model standard programming…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
We systematically classify all possible poles of superconformal blocks as a function of the scaling dimension of intermediate operators, for all superconformal algebras in dimensions three and higher. This is done by working out the…
We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…
We deal with a conjectured dichotomy for compact Hausdorff spaces: each such space contains a non-trivial converging omega-sequence or a non-trivial converging omega_1-sequence. We establish that this dichotomy holds in a variety of models;…
Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…