Related papers: Extensional Uniformity for Boolean Circuits
In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…
This paper explains why internal and external validity cannot be simultaneously maximised. It introduces "evidential states" to represent the information available for causal inference and shows that routine study operations (restriction,…
This paper presents a simple generalization of causal consistency suited to any object defined by a sequential specification. As causality is captured by a partial order on the set of operations issued by the processes on shared objects…
There are a few different ways to extend regular nonlinear dynamical systems by introducing power-law memory or considering fractional differential/difference equations instead of integer ones. This extension allows the introduction of…
In the interleaving model of concurrency, where events are totally ordered, linearizability is compositional: the composition of two linearizable objects is guaranteed to be linearizable. However, linearizability is not compositional when…
A new global approach in the study of duality transformations is introduced. The geometrical structure of complex line bundles is generalized to higher order U(1) bundles which are classified by quantized charges and duality maps are…
The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem…
We introduce a notion of a uniform structure on the set of all representations of a given separable, not necessarilly commutative $C^*$-algebra $\mathfrak{A}$ by introducing a suitable family of metrics on the set of representations of…
Temporal causality defines what property causes some observed temporal behavior (the effect) in a given computation, based on a counterfactual analysis of similar computations. In this paper, we study its closure properties and the…
We revisit the characterisation of modules over non-unital $C^*$-algebras analogous to modules of sections of vector bundles. A fullness condition on the associated multiplier module characterises a class of modules which closely mirror the…
Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…
We prove that for every Hausdorff space X and any uniform quadra space (Y,U) the topology on C(X,Y) induced by the uniformity U| of uniform convergence on the saturation family L coincides with the set-open topology on C(X,Y). In…
Building on the recent notion of non-uniform complete observability, and on the fact that this property ensures non-uniform exponential detectability, this paper establishes the converse implication under suitable additional assumptions.…
We identify a strong structural obstruction to Uniform Separation in constructive arithmetic. The mechanism is independent of semantic content; it emerges whenever two distinct evaluator predicates are sustained in parallel and inference…
The standard model of quantum circuits assumes operations are applied in a fixed sequential "causal" order. In recent years, the possibility of relaxing this constraint to obtain causally indefinite computations has received significant…
Boolean circuits abstract away from physical details to focus on the logical structure and computational behaviour of digital components. Although such circuits have been studied for many decades, compositionality has been widely ignored or…
The composite particle duality extends the notions of both flux attachment and statistical transmutation in spacetime dimensions beyond 2+1D. It constitutes an exact correspondence that can be understood either as a theoretical framework or…
Parameterized quantum circuits are the core of new technologies such as variational quantum algorithms and quantum machine learning, which makes studying its properties a valuable task. We implement parameterized circuits with definite and…
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…