Related papers: A note on fragments of uniform reflection in secon…
Statistical relational models provide compact encodings of probabilistic dependencies in relational domains, but result in highly intractable graphical models. The goal of lifted inference is to carry out probabilistic inference without…
We show that the twisted second moments of the Riemann zeta function averaged over the arithmetic progression $1/2 + i(an + b)$ with $a > 0$, $b$ real, exhibits a remarkable correspondance with the analogous continuous average and derive…
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 concerns preprojective representations of a finite connected valued quiver without oriented cycles. For each such representation, an explicit formula in terms of the geometry of the quiver gives a unique, up to a certain…
Quantum affine reflection algebras are coideal subalgebras of quantum affine algebras that lead to trigonometric reflection matrices (solutions of the boundary Yang-Baxter equation). In this paper we use the quantum affine reflection…
Disjoint $n$-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this paper, we show that if a countably categorical theory $T$ admits an…
In the context of reverse mathematics, effective transfinite recursion refers to a principle that allows us to construct sequences of sets by recursion along arbitrary well orders, provided that each set is $\Delta^0_1$-definable relative…
Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories. Turing progressions based on $n$-provability give rise to a $\Pi_{n+1}$ proof-theoretic ordinal. As such, to each theory $U$ we can…
We have previously established that $\Pi^1_1$-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann-Howard fixed point, over $\mathbf{ATR_0}$. In the present paper we show that the base theory can be…
We investigate the homology representation of the symmetric group on rank-selected subposets of subword order. We show that the homology module for words of bounded length, over an alphabet of size $n,$ decomposes into a sum of tensor…
Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth. The idea is to start with a collection…
Single-ended circuit topologies, and a theorem for the development thereof, are presented with which one may realize constant-resistance (or reflectionless) filters, having ideally zero reflection coefficient at all frequencies and from all…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
The uniform tracial completion of a C*-algebra A with compact non-empty trace space T(A) is obtained by completing the unit ball with respect to the uniform 2-seminorm $\|a\|_{2,T(A)}=\sup_{\tau \in T(A)} \tau(a^*a)^{1/2}$. The trace…
We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…
We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an…
We isolate a model-theoretic "standard-cut" phenomenon for true Pi0_1 sentences: if a model M satisfies ZFC + not-phi, then omega^M is not the standard omega, and any internal "witness" to not-phi is computationally inaccessible by…
We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…
It was recently shown by van den Broeck at al. that the symmetric weighted first-order model counting problem (WFOMC) for sentences of two-variable logic FO2 is in polynomial time, while it is Sharp-P_1 complete for some FO3-sentences. We…