Related papers: Topology-Free Type Structures with Conditioning Ev…
In this paper, we consider event structures and their probabilistic and quantum extensions as originally defined by Winskel. If these structures have already been part of sophisticated computational models, they have rarely been directly…
We investigate the question of when free structures of infinite rank (in a variety) possess model-theoretic properties like categoricity in higher power, saturation, or universality. Concentrating on left $R$-modules we show, among other…
A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…
Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…
We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.
For any tracial non-commutative probability space $(\mathcal{A}, \varphi)$, C\'{e}bron, Dahlqvist, and Male showed that one can always construct an enveloping traffic space $(\mathcal{G}(\mathcal{A}), \tau_\varphi)$ that extends the trace.…
In aperiodic order, non-periodic but "ordered" objects such as tilings, Delone sets, functions and measures are investigated. In this article we depict the common structure of these objects by using the general framework of abstract pattern…
We resolve the topological version of the Erd\H{o}s Similarity conjecture introduced previously by Gallagher, Lai and Weber. We show that a set is topologically universal on ${\mathbb R}$ if and only if it is of strong measure zero. As a…
A discrete group G has periodic cohomology over R if there is an element in a cohomology group, cup product with which induces an isomorphism in cohomology after a certain dimension. Adem and Smith showed if R = Z, then this condition is…
We consider Blanchet, Habegger, Masbaum and Vogel's universal construction of topological theories in dimension two, using it to produce interesting theories that do not satisfy the usual two-dimensional TQFT axioms. Kronecker's…
This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…
Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…
The Omitting Types Theorem in model theory and the Baire Category Theorem in topology are known to be closely linked. We examine the precise relation between these two theorems. Working with a general notion of logic we show that the…
In this article, we investigate the topological structure of large scale interacting systems on infinite graphs, by constructing a suitable cohomology which we call the uniform cohomology. The central idea for the construction is the…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
We investigate products of sets of reals with combinatorial covering properties. A topological space satisfies $\mathsf{S}_1(\Gamma,\Gamma)$ if for each sequence of point-cofinite open covers of the space, one can pick one element from each…
We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…
Two information structures are said to be close if, with high probability, there is approximate common knowledge that interim beliefs are close under the two information structures. We define an "almost common knowledge topology" reflecting…
We consider parameterized concurrent systems consisting of a finite but unknown number of components, obtained by replicating a given set of finite state automata. Components communicate by executing atomic interactions whose participants…
We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for deriving "leads-to" properties are proved in this general framework.…