Related papers: Topology-Free Type Structures with Conditioning Ev…

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

We show that the existence of a universal structure implies the existence of a generic structure for any approximable class $\mathcal{C}$ of countable structures. We also show that the converse is not true. As a consequence, we provide…

In this note, we prove an obstruction theorem for the existence of A infinite-structures over a commutative ring R on an algebra A associative up to homotopy, in terms of the Hochschild cohomology of the associative algebra H(A). The hidden…

We consider concurrent systems consisting of a finite but unknown number of components, that are replicated instances of a given set of finite state automata. The components communicate by executing interactions which are simultaneous…

We provide a counterexample to a conjecture by Thiagarajan (1996 and 2002) that regular event structures correspond exactly to event structures obtained as unfoldings of finite 1-safe Petri nets. The same counterexample is used to disprove…

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

We define a class of insulators with gapless surface states protected from localization due to the statistical properties of a disordered ensemble, namely due to the ensemble's invariance under a certain symmetry. We show that these…

We use hyperbolic towers to answer some model theoretic questions around the generic type in the theory of free groups. We show that all the finitely generated models of this theory realize the generic type $p_0$, but that there is a…

What does it mean for a causal structure to be `unknown'? Can we even talk about `repetitions' of an experiment without prior knowledge of causal relations? And under what conditions can we say that a set of processes with arbitrary,…

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…

Universality of quantum mechanics -- its applicability to physical systems of quite different nature and scales -- indicates that quantum behavior can be a manifestation of general mathematical properties of systems containing…

We give a constructive proof of a global controllability result for an autonomous system of ODEs guided by bounded locally Lipschitz and divergence free (i.e.\ incompressible) vector field, when the phase space is the whole Euclidean space…

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…

This paper provides an Open Mapping Theorem for topological modules over rings that have a zero sequence consisting of units. As an application it is shown that there is a unique complete and metrisable topology on finitely generated…

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

We prove that an integrable system over a symplectic manifold, whose symplectic form is covariantly constant w.r.t. the Gauss-Manin connection, carries a natural hyper-symplectic structure. Moreover, a special Kaehler structure is induced…

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…

The subtyping rules for intersection types traditionally employ a transitivity rule (Barendregt et al. 1983), which means that subtyping does not satisfy the subformula property, making it more difficult to use in filter models for compiler…

Conditions are essential in the statements of biological literature. Without the conditions (e.g., environment, equipment) that were precisely specified, the facts (e.g., observations) in the statements may no longer be valid. One…

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…