Related papers: Constructing Units in Product Systems
Starting from filters over the set of indices, we introduce structures in a product of sets where the coordinate sets have the given structures.
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
Proven-in-use arguments are needed when pre-developed products with an in-service history are to be used in different environments than those they were originally developed for. A product may include software modules or may be stand-alone…
We studied the construction problem of the unextendible product basis (UPB). We mainly give a method to construct a UPB of a quantum system through the UPBs of its subsystem. Using this method and the UPBs which are known for us, we…
Recent advances in programming languages study and design have established a standard way of grounding computational systems representation in category theory. These formal results led to a better understanding of issues of control and…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
Composite indicators are widely used to score or classify units evaluated on multiple criteria. Their construction typically involves aggregating criteria evaluations, a common practice in Multiple Criteria Decision Aiding (MCDA). Beyond…
A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This approach concludes finally the problem of the…
This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…
We present a framework to formally describe probabilistic system behavior and symbolically reason about it. In particular we aim at reasoning about possible failures and fault tolerance. We regard systems which are composed of different…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
We present a solution to the problem of understanding a system that produces a sequence of temporally ordered observations. Our solution is based on generating and interpreting a set of temporal decision rules. A temporal decision rule is a…
A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This result generalises the ones given up to date.
We say that a fusion system is the composition product of two subsystems if every morphism can be factored as a morphism in one fusion system followed by a morphism in the other. We establish a relationship between the characteristic…
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for…
We give a universal recipe for constructing nonlinear entanglement witnesses able to detect non-classical correlations in arbitrary systems of distinguishable and/or identical particles for an arbitrary number of constituents. The…
In this note we prove that the set of all uniformly continuous units on a product system over a C* algebra B can be endowed with the structure of left right B - B Hilbert module after identifying similar units by the suitable equivalence…
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…