This book provides a general survey of the main concepts, questions and results that have been developed in the recent interactions between quantum information, quantum computation and logic. Divided into 10 chapters, the books starts with an introduction of the main concepts of the quantum-theoretic formalism used in quantum information. It then gives a synthetic presentation of the main “mathematical characters” of the quantum computational game: qubits, quregisters, mixtures of quregisters, quantum logical gates. Next, the book investigates the puzzling entanglement-phenomena (...) and logically analyses the Einstein–Podolsky–Rosen paradox and introduces the reader to quantum computational logics, and new forms of quantum logic. The middle chapters investigate the possibility of a quantum computational semantics for a language that can express sentences like “Alice knows that everybody knows that she is pretty”, explore the mathematical concept of quantum Turing machine, and illustrate some characteristic examples that arise in the framework of musical languages. The book concludes with an analysis of recent discussions, and contains a Mathematical Appendix which is a survey of the definitions of all main mathematical concepts used in the book. (shrink)

Unlike the standard Quantum Computational Logic, where the carrier of information is conventionally assumed to be only the last qubit over a sequence of many qubits, here we propose an extended version of the QCL where the number and the position of the target qubits are arbitrary.

We present a generalization of the problem of pattern recognition to arbitrary probabilistic models. This version deals with the problem of recognizing an individual pattern among a family of different species or classes of objects which obey probabilistic laws which do not comply with Kolmogorov’s axioms. We show that such a scenario accommodates many important examples, and in particular, we provide a rigorous definition of the classical and the quantum pattern recognition problems, respectively. Our framework allows for the introduction of (...) non-trivial correlations between the different species involved, opening the door to a new way of harnessing these physical resources for solving pattern recognition problems. Finally, we present some examples and discuss the computational complexity of the quantum pattern recognition problem, showing that the most important quantum computation algorithms can be described as non-Kolmogorovian pattern recognition problems. (shrink)

We propose a new interpretation of objective deterministic chances in statistical physics based on physical computational complexity. This notion applies to a single physical system (be it an experimental set--up in the lab, or a subsystem of the universe), and quantifies (1) the difficulty to realize a physical state given another, (2) the 'distance' (in terms of physical resources) from a physical state to another, and (3) the size of the set of time--complexity functions that are compatible with the physical (...) resources required to reach a physical state from another. (shrink)

In this article, we address fallacious analogical reasoning and the Metaphoric Fallacy to a Deductive Inference (MFDI), recently discussed by B. Lightbody and M. Berman (2010). We claim that the authors’ proposal to introduce a new fallacy is only partly justified. We also argue that, in some relevant cases, fallacious analogical reasoning involving metaphors is only affected by the use of quaternio terminorum.

In the framework of algebras with infinitary operations, the equational theory of $$\bigvee _{\kappa }$$ ⋁ κ -complete Heyting algebras or Heyting $$\kappa $$ κ -frames is studied. A Hilbert style calculus algebraizable in this class is formulated. Based on the infinitary structure of Heyting $$\kappa $$ κ -frames, an equational type completeness theorem related to the $$\langle \bigvee, \wedge, \rightarrow, 0 \rangle $$ ⟨ ⋁, ∧, →, 0 ⟩ -structure of frames is also obtained.

Knowledge representation is a central issue for Artificial Intelligence and the Semantic Web. In particular, the problem of representing n-ary relations in RDF-based languages such as RDFS or OWL by no means is an obvious one. With respect to previous attempts, we show why the solutions proposed by the well known W3C Working Group Note on n-ary relations are not satisfactory on several scores. We then present our abstract model for representing n-ary relations as directed labeled graphs, and we show (...) how this model gives rise to a new ontological pattern for the representation of such relations in the Semantic Web. To this end, we define PROL. PROL is an ontological language designed to express any n-ary fact as a parametric pattern, which turns out to be a special RDF graph. The vocabulary of PROL is defined by a simple RDFS ontology. We argue that the parametric pattern may be particularly beneficial in the context of the Semantic Web, in virtue of its high expressive power, technical simplicity, and faithful meaning rendition. Examples are also provided. (shrink)

Quantum theory is perhaps our best confirmed theory for a description of the physical properties of nature. On top of demonstrating great empirical effectiveness, many technological developments in the 20th century (such as the interpretation of the periodic table of elements, CD players, holograms, and quantum state teleportation) were only made possible with Quantum theory.Despite its success in the past decades, even today it still remains without a universally accepted interpretation.This book provides an interdisciplinary perspective on the question; 'What is (...) Quantum Mechanics talking about?', a question which continues to be one of the most fascinating and important questions in science.Using an interdisciplinary approach to foundational problems in Quantum Mechanics (QM), ranging from philosophical questions about the interpretation of QM to technical problems in quantum computation, this book explores quantum mechanics from different perspectives (physical, logical, philosophical and mathematical), by researchers from Europe, North America, and South America. (shrink)

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Aharonov quantum computational structure. We show that the quotient of this structure is isomorphic to a structure based on a particular set of complex numbers (the closed disc with center \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(\frac{1}{2},\frac{1}{2})$\end{document} and radius \documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\frac{1}{2}$\end{document} ). (shrink)

The characteristic holistic features of the quantum theoretic formalism and the intriguing notion of entanglement can be applied to a field that is far from microphysics: logical semantics. Quantum computational logics are new forms of quantum logic that have been suggested by the theory of quantum logical gates in quantum computation. In the standard semantics of these logics, sentences denote quantum information quantities: systems of qubits (quregisters) or, more generally, mixtures of quregisters (qumixes), while logical connectives are interpreted as special (...) quantum logical gates (which have a characteristic reversible and dynamic behavior). In this framework, states of knowledge may be entangled, in such a way that our information about the whole determines our information about the parts; and the procedure cannot be, generally, inverted. In spite of its appealing properties, the standard version of the quantum computational semantics is strongly “Hilbert-space dependent”. This certainly represents a shortcoming for all applications, where real and complex numbers do not generally play any significant role (as happens, for instance, in the case of natural and of artistic languages). We propose an abstract version of quantum computational semantics, where abstract qumixes, quregisters and registers are identified with some special objects (not necessarily living in a Hilbert space), while gates are reversible functions that transform qumixes into qumixes. In this framework, one can give an abstract definition of the notions of superposition and of entangled pieces of information, quite independently of any numerical values. We investigate three different forms of abstract holistic quantum computational logic. (shrink)

How are abstract concepts and musical themes recognized on the basis of some previous experience? It is interesting to compare the different behaviors of human and of artificial intelligences with respect to this problem. Generally, a human mind that abstracts a concept (say, table) from a given set of known examples creates a table-Gestalt: a kind of vague and out of focus image that does not fully correspond to a particular table with well determined features. A similar situation arises in (...) the case of musical themes. Can the construction of a gestaltic pattern, which is so natural for human minds, be taught to an intelligent machine? This problem can be successfully discussed in the framework of a quantum approach to pattern recognition and to machine learning. The basic idea is replacing classical data sets with quantum data sets, where either objects or musical themes can be formally represented as pieces of quantum information, involving the uncertainties and the ambiguities that characterize the quantum world. In this framework, the intuitive concept of Gestalt can be simulated by the mathematical concept of positive centroid of a given quantum data set. Accordingly, the crucial problem “how can we classify a new object or a new musical theme (we have listened to) on the basis of a previous experience?” can be dealt with in terms of some special quantum similarity-relations. Although recognition procedures are different for human and for artificial intelligences, there is a common method of “facing the problems” that seems to work in both cases. (shrink)

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. The basic algebraic properties of this system have been studied in Dalla Chiara et al. (Foundations of Physics 39(6):559–572, 2009), where we have introduced the notion of Shi-Aharonov quantum computational structure. In this paper we propose an algebraic abstraction from the Hilbert-space quantum computational structures, by introducing the notion of Toffoli-Hadamard algebra. From an intuitive point of (...) view, such abstract algebras represent a natural quantum generalization of both classical and fuzzy-like structures. (shrink)

This paper explores taste fragmentalism, a novel approach to matters of taste and faultless disagreement. The view is inspired by Kit Fine’s fragmentalism about time, according to which the temporal dimension can be constituted—in an absolute manner—by states that are pairwise incompatible, provided that they do not obtain together. In the present paper, we will apply this metaphysical framework to taste states. In our proposal, two incompatible taste states (such as the state of rhubarb’s being tasty and the state of (...) rhubarb’s being distasteful) can both constitute reality in an absolute manner, although no agent can have joint access to both states. We will then develop a formalised version of our view by means of an exact truthmaker semantics for taste assertions. Within this framework—we argue—our linguistic and inferential practices concerning cases of faultless disagreement are elegantly vindicated, thus suggesting that taste fragmentalism is worth of further consideration. (shrink)

Dans la mythologie grecque, Prométhée - le 'prévoyant' - déroba le feu aux dieux et le transmit aux hommes. Zeus, courroucé par ce transfert technologique, condamna Prométhée à un châtiment itéré à l'identique, à l'infini, algorithmique. Le problème que pose l'ancien mythe est celui des limites de la connaissance. En termes modernes, jusqu'à quel point pouvons-nous transformer la nature sans une connaissance des conséquences de nos actions sur elle? Cette question nous pousse à analyser les limites des sciences : à (...) une techno-science devenue toujours plus invasive, la science répond en se donnant à elle-même des limites"--Page 4 of cover. (shrink)

Sceptical Paths gathers a variety of innovative studies that inquire into the presence and function of sceptical elements, strategies, and approaches in various traditions throughout Ancient, Medieval, Modern, and contemporary philosophy. Special at.

The moving spotlight account (MS) is a view that combines an eternalist ontology and an A-theoretic metaphysics. The intuition underlying MS is that the present time is somehow privileged and experientially vivid, as if it were illuminated by a moving spotlight. According to MS-theorists, a key reason to prefer MS to B-theoretic eternalism is that our experience of time supports it. We argue that this is false. To this end, we formulate a new family of positions in the philosophy of (...) time, which differ from MS in that, intuitively, they admit a plurality of moving spotlights. We argue that these ‘deviant’ variants of MS cannot be dismissed as conceptually incoherent, and that they are as well-supported by our experience as is MS. One of these variants, however, is consistent with the B-theory. Thus, if our experience of time supports MS, then it supports the B-theory as well. (shrink)

Open futurism is the indeterministic position according to which the future is ‘open’, i.e., there is now no fact of the matter as to what future contingent events will actually obtain. Many open futurists hold a branching conception of time, in which a variety of possible futures exist. This paper introduces two challenges to branching-time open futurism, which are similar in spirit to a challenge posed by Fine to tense realism. The paper argues that, to address the new challenges, open (...) futurists must adopt an objective, non-perspectival notion of actuality and subscribe to an A-theoretic, dynamic conception of reality. Moreover, given a natural understanding of “actual future”, it is perfectly sensible for open futurists to hold that a unique, objectively actual future exists, contrary to a common assumption in the current debate. The paper also contends that recognising the existence of a unique actual future helps open futurists to avoid potential misconceptions. (shrink)

Artefacts do not always do what they are supposed to, due to a variety of reasons, including manufacturing problems, poor maintenance, and normal wear-and-tear. Since software is an artefact, it should be subject to malfunctioning in the same sense in which other artefacts can malfunction. Yet, whether software is on a par with other artefacts when it comes to malfunctioning crucially depends on the abstraction used in the analysis. We distinguish between “negative” and “positive” notions of malfunction. A negative malfunction, (...) or dysfunction, occurs when an artefact token either does not or cannot do what it is supposed to. A positive malfunction, or misfunction, occurs when an artefact token may do what is supposed to but, at least occasionally, it also yields some unintended and undesirable effects. We argue that software, understood as type, may misfunction in some limited sense, but cannot dysfunction. Accordingly, one should distinguish software from other technical artefacts, in view of their design that makes dysfunction impossible for the former, while possible for the latter. (shrink)

Das Buch enthält die Einführung in die Lektüre sowie den Textkommentar zu den der Analyse der Grundsätze der Modalität gewidmeten "Postulaten des empirischen Denkens überhaupt". Untersucht wird Kants gesamte Theorie der Modalbegriffe (Möglichkeit - Unmöglichkeit, Dasein - Nichtsein, Notwendigkeit - Zufälligkeit) seit Mitte der 1750er Jahre bis zur Kritik der reinen Vernunft. Die Postulate sind nach Kant nicht objektiv, sondern subjektiv-synthetisch: Der Gegenstand der Erfahrung, welcher zunächst anhand der objektiv-synthetischen Funktionen der Quantität, Qualität und Relation bestimmt wird, lässt sich nun (...) in seinem Verhältnis zum setzenden Subjekt betrachten. Die Postulate thematisieren jedoch nicht - hier liegt die konstitutive Charakteristik dieser synthetischen Urteile a priori - das Subjekt selbst, sondern das Objekt als solches und die Objektivität überhaupt. Wie diese Untersuchung zeigt, antwortet Kant erst hier - nicht in den viel diskutierten Deduktionskapiteln oder in den anderen Grundsatzkapiteln - auf die Frage "Was ist ein Objekt?" und bezieht zugleich Stellung gegenüber anderen philosophischen Theorien der Objektivität des 18. Jahrhunderts: Rationalismus, Empirismus, Idealismus, Skeptizismus. (shrink)

CHAPTER Structure and function In physical systems made by a large number of basic constituents one can observe collective properties which find their ...

Computing, today more than ever before, is a multi-faceted discipline which collates several methodologies, areas of interest, and approaches: mathematics, engineering, programming, and applications. Given its enormous impact on everyday life, it is essential that its debated origins are understood, and that its different foundations are explained. On the Foundations of Computing offers a comprehensive and critical overview of the birth and evolution of computing, and it presents some of the most important technical results and philosophical problems of the discipline, (...) combining both historical and systematic analyses. -/- The debates this text surveys are among the latest and most urgent ones: the crisis of foundations in mathematics and the birth of the decision problem, the nature of algorithms, the debates on computational artefacts and malfunctioning, and the analysis of computational experiments. By covering these topics, On the Foundations of Computing provides a much-needed resource to contextualize these foundational issues. -/- For practitioners, researchers, and students alike, a historical and philosophical approach such as what this volume offers becomes essential to understand the past of the discipline and to figure out the challenges of its future. (shrink)

While there has been increased attention to emotions and institutions, the role of denial and repression of emotions has been overlooked. We argue that not only the expression and the feeling of emotions, but also their control through denial contribute to stabilize institutional orders. The role denial plays is that of avoiding the emergence of disruptive emotions that might motivate a challenge to the status quo. Reflecting on the example of the livestock industry, we propose a theoretical model that identifies (...) seeds for change in denied emotional contradictions in an inte- gration of the cultural-relational and issue-based conceptions of organi- zational fields. (shrink)

Riprendendo quanto George Edward Moore scrive a proposito del concetto di “bene” (“good”), Hans Kelsen sostiene che il concetto di “dovere” (“Sollen”) sia un concetto semplice, un concetto ultimo, e in quanto tale né definibile, né analizzabile. Questa tesi di Kelsen sembra essere smentita dalle ricerche che sono state condotte parallelamente da Georg Henrik von Wright e Amedeo Giovanni Conte a partire dagli anni '80 del XX secolo. Von Wright e Conte hanno, infatti, distinto dal concetto di “dovere deontico” (“deontic (...) Ought”), il dovere par excellence, altre specie di dovere che essi considerano categorialmente irriducibili al concetto di dovere deontico come il “dovere tecnico” (“technical Ought”) e il “dovere anankastico”. È proprio all'indagine di queste due specie di dovere adeontico che è dedicato il libro Anankastico in deontica. (shrink)