An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

An arithmetical theorem for partially ordered sets

The simplest multiplicative systems in which arithmetical ideas can be defined are semigroups. For such systems irreducible (prime) elements can be introduced and conditions under which the fundamental theorem of arithmetic holds have been investigated (Clifford (3)). After identifying associates, the elements of the semigroup form a partially ordered set with respect to the ordinary division relation. This suggests the possibility of an analogous arithmetical result for abstract partially ordered sets. Although nothing corresponding to product exists in a partially ordered set, there is a notion similar to g.c.d. This is the meet operation, defined as greatest lower bound. Thus irreducible elements, namely those elements not expressible as meets of proper divisors can be introduced. The assumption of the ascending chain condition then implies that each element is representable as a reduced meet of irreducibles. The central problem of this thesis is to determine conditions on the structure of the partially ordered set in order that each element have a unique such representation.

Part I contains preliminary results and introduces the principal tools of the investigation. In the second part, basic properties of the lattice of ideals and the connection between its structure and the irreducible decompositions of elements are developed. The proofs of these results are identical with the corresponding ones for the lattice case (Dilworth (2)). The last part contains those results whose proofs are peculiar to partially ordered sets and also contains the proof of the main theorem.

The Forbidden Quantum Adder

Quantum information provides fundamentally different computational resources than classical information. We prove that there is no unitary protocol able to add unknown quantum states belonging to different Hilbert spaces. This is an inherent restriction of quantum physics that is related to the impossibility of copying an arbitrary quantum state, i.e., the no-cloning theorem. Moreover, we demonstrate that a quantum adder, in absence of an ancillary system, is also forbidden for a known orthonormal basis. This allows us to propose an approximate quantum adder that could be implemented in the lab. Finally, we discuss the distinct character of the forbidden quantum adder for quantum states and the allowed quantum adder for density matrices.

A New Type of Coincidence and Common Fixed Point Theorem with Applications

Coincidence and common fixed point theorems for a class of 'Ciric-Suzuki hybrid contractions involving a multivalued and two single-valued maps in a metric space are obtained. Some applications including the existence of a common solution for certain class of functional equations arising in a dynamic programming are also discussed..

An approach version of fuzzy metric spaces including an ad hoc fixed point theorem

In this paper, inspired by two very different, successful metric theories such us the real view-point of Lowen's approach spaces and the probabilistic field of Kramosil and Michalek's fuzzymetric spaces, we present a family of spaces, called fuzzy approach spaces, that are appropriate to handle, at the same time, both measure conceptions. To do that, we study the underlying metric interrelationships between the above mentioned theories, obtaining six postulates that allow us to consider such kind of spaces in a unique category. As a result, the natural way in which metric spaces can be embedded in both classes leads to a commutative categorical scheme. Each postulate is interpreted in the context of the study of the evolution of fuzzy systems. First properties of fuzzy approach spaces are introduced, including a topology. Finally, we describe a fixed point theorem in the setting of fuzzy approach spaces that can be particularized to the previous existing measure spaces.

On the theorem of Reichert

This paper reworks and amplifies Reichert's proof of his theorem (1969) which asserts that any impedance function of a one-port electrical network which can be realised with two reactive elements and an arbitrary number of resistors can be realised with two reactive elements and three resistors. © 2012 Elsevier B.V. All rights reserved.