Related papers: Recursive Completion in Higher K-Models: Front-See…
Nontrivial combinatory algebras with S and K must be infinite. Associativity is incompatible with combining a classifier and a retraction pair in a finite extensional magma. These obstructions exclude several standard settings from the…
Repetitiveness in projective and injective resolutions and its influence on homological dimensions are studied. Some variations on the theme of repetitiveness are introduced, and it is shown that the corresponding invariants lead to very…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…
In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of…
Let C be the complex field and K=C((x,y)) or K=C((x))(y). Let G be a connected linear algebraic group over K. Under the assumption that the K-variety G is K-rational, i.e. that the function field is purely transcendant, it was proved that a…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
The multipullback quantization of complex projective spaces lacks the naive quantum CW-complex structure because the quantization of an embedding of the $n$-skeleton into the $(n+1)$-skeleton does not exist. To overcome this difficulty, we…
Lumsdaine (2010) and van den Berg-Garner (2011) proved that types in Martin-L\"of type theory carry the structure of weak {\omega}-groupoids. Their proofs, while foundational, rely on abstract properties of the identity type without…
We compute the equivariant K-theory with integer coefficients of an equivariantly formal isotropy action, subject to natural hypotheses which cover the three major classes of known examples. The proof proceeds by constructing a map of…
Kitchloo and Morava give a strikingly simple picture of elliptic cohomology at the Tate curve by studying a completed version of $S^1$-equivariant $K$-theory for spaces. Several authors (cf [ABG],[KM],[L]) have suggested that an equivariant…
We provide new equivalent conditions for an algebra $\Lambda$ to be $g$-finite, analogous to those established by L. Demonet, O. Iyama, and G. Jasso, but within the category of projective presentations $\mathcal{K}^{[-1,0]}(\text{proj}…
We show that the hermitian K-theory space of a commutative ring R can be identified, up to A^1-homotopy, with the group completion of the groupoid of oriented finite Gorenstein R-algebras, i.e., finite locally free R-algebras with…
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
Let $R$ be a ring with identity. Inspired by recent work of Emmanouil, we show that the derived category of $R$ is equivalent to the chain homotopy category of all K-flat complexes with pure-injective components. This is implicitly related…
We construct a notion of derived completion which applies to homomorphisms of commutative S-algebras. We study the relationship of the construction with other constructions of completions, and prove various invariance properties. The…
We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite…
Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…
In this paper, we give an overview of some recent work on applying tools from category theory in finite model theory, descriptive complexity, constraint satisfaction, and combinatorics. The motivations for this work come from Computer…
Starting from a subinvariant positive definite kernel under a branching pullback, we attach to the resulting kernel tower a canonical electrical network on the word tree whose edge weights are the diagonal increments. This converts diagonal…