Related papers: Unique Normal Forms in Infinitary Weakly Orthogona…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo were inspired by Knuth-Bendix completion, and introduced a confluent rewriting system that (1) extends the naive rewriting system, and (2) is stable…
The weak regular coherence is a coarse property of a finitely generated group $\Gamma$. It was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen's regular coherence as part of computation of the…
The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers. We show that similar methods can be used to characterize the…
We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…
In models of oriented closed strings, anomaly cancellations are deeply linked to the {\it modular invariance} of the torus amplitude. If open and/or unoriented strings are allowed, there are no non-trivial modular transformations in the…
We consider the Pohlmeyer-type reduced theory found by explicitly solving the Virasoro constraints in the formulation of AdS_5xS^5 superstring in terms of supercoset currents. The resulting set of classically equivalent, integrable…
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
We give criteria on an inverse system of finite groups that ensure the limit is just infinite or hereditarily just infinite. More significantly, these criteria are 'universal' in that all (hereditarily) just infinite profinite groups arise…
We use reverse mathematics to analyze "iterated jump" versions of the following four principles: the atomic model theorem with subenumerable types (AST), the diagonally noncomputable principle (DNR), weak weak K\H{o}nig's lemma (WWKL), and…
Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose…
We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…
The existence of the weak limit as n --> infinity of the uniform measure on rooted triangulations of the sphere with n vertices is proved. Some properties of the limit are studied. In particular, the limit is a probability measure on random…
In the past decades, weak convergence theory for stochastic processes has become a standard tool for analyzing the asymptotic properties of various statistics. Routinely, weak convergence is considered in the space of bounded functions…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
The purpose of this contribution is to show that some of the basic ideas of turbulence can be addressed in a deterministic setting instead of introducing random realizations of the fluid. Weak limits of oscillating sequences of solutions…
Variational regularisation is the primary method for solving inverse problems, and recently there has been considerable work leveraging deeply learned regularisation for enhanced performance. However, few results exist addressing the…
There are many evaluation strategies for term rewrite systems, but automatically proving termination or analyzing complexity is usually easiest for innermost rewriting. Several syntactic criteria exist when innermost termination implies…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…