Related papers: Ordered combinatory algebras and realizability

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…

We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $\beta\eta$-equivalence classes of…

We introduce a notion of Pre-structurable Algebras based upon triality relations and study its relation to structurable algebra of Allison, as well as to Lie algebras satisfying triality.

Let $\FRAK{g}$ be a classical simple Lie superalgebra. To every nilpotent orbit $\cal O$ in $\FRAK{g}_0$ we associate a Clifford algebra over the field of rational functions on $\cal O$. We find the rank, $k(\cal O)$ of the bilinear form…

Inspired by Morse theory, we introduce a topological stack Broken, which we refer to as the moduli stack of broken lines. We show that Broken can be presented as a Lie groupoid with corners and provide a combinatorial description of sheaves…

A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…

In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate…

Let $A$ be a stably finite simple unital $C^*$-algebra and suppose $\alpha $ is an action of a finite group $G$ with the tracial Rokhlin property. Suppose further $A$ has real rank zero and the order on projections over $A$ is determined by…

We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…

We give a general method to build categories of combinatorial manifolds, i.e. categories of combinatorial objects satisfying some local property at every "point", as coreflective subcategories of categories of relational presheaves. To do…

We show that, up to terms of order 1/kappa^5, the kappa-deformed Poincare algebra can be endowed with a triangular quasibialgebra structure. The universal R matrix and coassociator are given explicitly to the first few orders. In the…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

Let $A = \bigoplus_{i \geqslant 0} A_i$ be a graded locally finite $k$-algebra such that $A_0$ is an arbitrary finite-dimensional algebra satisfying some splitting condition. In this paper we develop a generalized Koszul theory generalizing…

We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary. We define the…

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…

We give a method to transform into programs, classical proofs using a well ordering of the reals. The technics uses a generalization of Cohen's forcing and the theory of classical realizability introduced by the author.

We prove a generalization of Maehara's lemma to show that the extensions of classical and intuitionistic first-order logic with a special type of geometric axioms, called singular geometric axioms, have Craig's interpolation property. As a…

It is shown that an ensemble of particles with tripolar (colour) charges will necessarily cohere in a hierarchy of structures, from simple clusters and strings to complex aggregates and cyclic molecule-like structures. The basic…