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

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.

Approximate knowledge of rationality and correlated equilibria

We extend Aumann's [3] theorem deriving correlated equilibria as a consequence of common priors and common knowledge of rationality by explicitly allowing for non-rational behavior. We replace the assumption of common knowledge of rationality with a substantially weaker notion, joint p-belief of rationality, where agents believe the other agents are rational with probabilities p = (pi)i2I or more. We show that behavior in this case constitutes a constrained correlated equilibrium of a doubled game satisfying certain p-belief constraints and characterize the topological structure of the resulting set of p-rational outcomes. We establish continuity in the parameters p and show that, for p su ciently close to one, the p-rational outcomes are close to the correlated equilibria and, with high probability, supported on strategies that survive the iterated elimination of strictly dominated strategies. Finally, we extend Aumann and Dreze's [4] theorem on rational expectations of interim types to the broader p-rational belief systems, and also discuss the case of non-common priors.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

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.

Pata contractions and coupled type fixed points

A new coupled fixed point theorem related to the Pata contraction for mappings having the mixed monotone property in partially ordered complete metric spaces is established. It is shown that the coupled fixed point can be unique under some extra suitable conditions involving mid point lower or upper bound properties. Also the corresponding convergence rate is estimated when the iterates of our function converge to its coupled fixed point.

Density-potential mapping in the standard and quantum electrodynamical time-dependent density functional theory

131 p.

Biomimetic Cloning of Quantum Observables

We propose a bio-inspired sequential quantum protocol for the cloning and preservation of the statistics associated to quantum observables of a given system. It combines the cloning of a set of commuting observables, permitted by the no-cloning and no-broadcasting theorems, with a controllable propagation of the initial state coherences to the subsequent generations. The protocol mimics the scenario in which an individual in an unknown quantum state copies and propagates its quantum information into an environment of blank qubits Finally, we propose a realistic experimental implementation of this protocol in trapped ions.

Evolución de la población en los municipios de Vizcaya

En este estudio se analiza la evolución de la población a escala municipal y provincial para el territorio histórico de Vizcaya de 1900 a 2013 con el objetivo de establecer sus pautas. En un primer bloque se tratará el crecimiento demográfico en los municipios de la provincia, destacando las poblaciones con mayor variación de su población y explicando sus causas. Más tarde se analizará la distribución de la población sobre la superficie de Vizcaya, es decir, dónde tiende a concentrarse. Para tratar este apartado se valorarán factores como el tamaño comarcal o la densidad de población tanto a nivel provincial como comarcal. Finalmente, se hará un breve repaso a la situación de los diferentes sectores de actividad en el siglo XXI. El análisis de la población vizcaína desde 1900 ha permitido demostrar la relación existente entre los ciclos económicos y el cambio demográfico identificando tres etapas relevantes (1900-1950, 1950-1980 y 1980-2013). La población de Vizcaya durante el siglo XX se ha caracterizado por un patrón de crecimiento continuo hasta finales de siglo ayudado por la mejora de las comunicaciones, como la inauguración del Metro de Bilbao.

Disponibilidad de micromamíferos en el área de campeo del cárabo común en los bosques de Burceña (Valle de Mena): Primeros resultados del estudio

[ES] Este trabajo forma parte de un proyecto en el que se estudian dos poblaciones de cárabo común (Strix aluco); una en Durango (Bizkaia) y otra en Burceña (Burgos). Este trabajo se ha llevado a cabo en Burceña y en él se muestran los primeros resultados del uso del espacio de estas rapaces nocturnas y su disponibilidad de alimento en los bosques de esta zona. Para ello hemos obtenido localizaciones de diez cárabos durante un año para conocer los territorios de cada uno y hemos capturado en vivo la dieta principal de esta ave, micromamíferos. Estos resultados los hemos relacionado entre sí para saber si influye el uso del espacio en las capturas de micromamíferos. Estas dos variables también las hemos relacionado con el tipo y la edad de los bosques muestreados. Según los resultados obtenidos podemos afirmar que sí existe una influencia del uso en las capturas, demostrando una relación negativa; es decir, donde se han capturado más micromamíferos es en los bosques que menos frecuentan los cárabos, que a su vez, son los bosques menos accesibles para estas rapaces. ABSTRACT This investigation is part of a work project whereby two Tawny owl (Strix aluco) populations are studied. One of them lives in Durango, Biscay and the other one in Burceña, Burgos. This specific work took place in Burceña and lasted one year. It shows the first results of the study on the use of the space of the Tawny owls and the food availability in their woodland range area. We spotted and traced the home range of ten different tawny owls, and also trapped small mammals which are the staple diet of these owls. We compared both the results obtained in order to know if the use of the area is related to the capture of small mammals. These two variables (space-capture) were also related to the type and age of the sampled forests. The results obtained show that it is true there is an influence of the use of space upon the captures proving to be a negative relation, that is, the largest numbers of micromammals were captured in the woodlands where there are fewer owls, because they are the least accessible forests for these birds of prey.