A decade ago, Isham and Butterfield proposed a topos-theoretic approach to quantum mechanics, which meanwhile has been extended by Döring and Isham so as to provide a new mathematical foundation for all of physics. Last year, three of the present authors redeveloped and refined these ideas by combining the C*-algebraic approach to quantum theory with the so-called internal language of topos theory (Heunen et al. in arXiv:0709.4364). The goal of the present paper is to illustrate our abstract setup (...) through the concrete example of the C*-algebra M n (ℂ) of complex n×n matrices. This leads to an explicit expression for the pointfree quantum phase space Σ n and the associated logical structure and Gelfand transform of an n-level system. We also determine the pertinent non-probabilisitic state-proposition pairing (or valuation) and give a very natural topos-theoretic reformulation of the Kochen–Specker Theorem.In our approach, the nondistributive lattice ℘(M n (ℂ)) of projections in M n (ℂ) (which forms the basis of the traditional quantum logic of Birkhoff and von Neumann) is replaced by a specific distributive lattice $\mathcal{O}(\Sigma_{n})$ of functions from the poset $\mathcal{C}(M_{n}(\mathbb{C}))$ of all unital commutative C*-subalgebras C of M n (ℂ) to ℘(M n (ℂ)). The lattice $\mathcal{O}(\Sigma_{n})$ is essentially the (pointfree) topology of the quantum phase space Σ n , and as such defines a Heyting algebra. Each element of $\mathcal{O}(\Sigma_{n})$ corresponds to a “Bohrified” proposition, in the sense that to each classical context $C\in\mathcal{C}(M_{n}(\mathbb{C}))$ it associates a yes-no question (i.e. an element of the Boolean lattice ℘(C) of projections in C), rather than being a single projection as in standard quantum logic. Distributivity is recovered at the expense of the law of the excluded middle (Tertium Non Datur), whose demise is in our opinion to be welcomed, not just in intuitionistic logic in the spirit of Brouwer, but also in quantum logic in the spirit of von Neumann. (shrink)

Fuzzy intuitionistic quantum logics (called also Brouwer-Zadeh logics) represent to non standard version of quantum logic where the connective not is split into two different negation: a fuzzy-like negation that gives rise to a paraconsistent behavior and an intuitionistic-like negation. A completeness theorem for a particular form of Brouwer-Zadeh logic (BZL 3) is proved. A phisical interpretation of these logics can be constructed in the framework of the unsharp approach to quantum theory.

In this article von Neumann’s proposal that in quantum mechanics projections can be seen as propositions is followed. However, the quantum logic derived by Birkhoff and von Neumann is rejected due to the failure of the law of distributivity. The options for constructing a distributive logic while adhering to von Neumann’s proposal are investigated. This is done by rejecting the converse of the proposal, namely, that propositions can always be seen as projections. The result is a (...) weakly Heyting algebra for describing the language of quantum mechanics. (shrink)

In their seminal paper Birkhoff and von Neumann revealed the following dilemma:[ ] whereas for logicians the orthocomplementation properties of negation were the ones least able to withstand a critical analysis, the study of mechanics points to the distributive identities as the weakest link in the algebra of logic.

In this paper, we study the relationship among classical logic, intuitionistic logic, and quantum logic . These logics are related in an interesting way and are not far apart from each other, as is widely believed. The results in this paper show how they are related with each other through a dual intuitionistic logic . Our study is completely syntactical.

Research within the operational approach to the logical foundations of physics has recently pointed out a new perspective in which quantum logic can be viewed as an intuitionistic logic with an additional operator to capture its essential, i.e., non-distributive, properties. In this paper we will offer an introduction to this approach. We will focus further on why quantum logic has an inherent dynamic nature which is captured in the meaning of "orthomodularity" and on how (...) it motivates physically the introduction of dynamic implication operators, each for which a deduction theorem holds with respect to a dynamic conjunction. As such we can offer a positive answer to the many who pondered about whether quantum logic should really be called a logic. Doubts to answer the question positively were in first instance due to the former lack of an implication connective which satisfies the deduction theorem within quantum logic. (shrink)

In a preceding paper [1] it was shown that quantum logic, given by the tableaux-calculus Teff, is complete and consistent with respect to the dialogic foundation of logics. Since in formal dialogs the special property of the 'value-definiteness' of propositions is not postulated, the calculus $T_{eff}$ represents a calculus of effective (intuitionistic) quantum logic. Beginning with the tableaux-calculus the equivalence of $T_{eff}$ to calculi which use more familiar figures such as sequents and implications can be (...) investigated. In this paper we present a sequents-calculus of Gentzen-type and a propositional calculus of Brouwer-type which are shown to be equivalent to $T_{eff}$ . The effective propositional calculus provides an interpretation for a lattice structure, called quasi-implicative lattice. If, in addition, the value-definiteness of quantum mechanical propositions is postulated, a propositional calculus is obtained which provides an interpretation for a quasi-modular orthocomplemented lattice which, as is well-known, has as a model the lattice of subspaces of a Hilbert space. (shrink)

In Coecke (2002) we proposed the intuitionistic or disjunctive representation of quantum logic, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these properties, where this complete Heyting algebra goes equipped with an additional operation, the operational resolution, which identifies the properties within the logic of propositions. This representation has an important application “towards dynamic quantum logic”, namely in describing the temporal indeterministic propagation of (...) actual properties of physical systems. This paper can as such by conceived as an addendum to “Quantum Logic in Intuitionistic Perspective” that discusses spin-off and thus provides an additional motivation. We derive a quantaloidal semantics for dynamic disjunctive quantum logic and illustrate it for the particular case of a perfect (quantum) measurement. (shrink)

In Coecke (2002) we proposed the intuitionistic or disjunctive representation of quantum logic, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these properties, where this complete Heyting algebra goes equipped with an additional operation, the operational resolution, which identifies the properties within the logic of propositions. This representation has an important application towards dynamic quantum logic, namely in describing the temporal indeterministic propagation of (...) actual properties of physical systems. This paper can as such by conceived as an addendum to Quantum Logic in Intuitionistic Perspective that discusses spin-off and thus provides an additional motivation. We derive a quantaloidal semantics for dynamic disjunctive quantum logic and illustrate it for the particular case of a perfect (quantum) measurement. (shrink)

This paper is based on a semantic foundation of quantum logic which makes use of dialog-games. In the first part of the paper the dialogic method is introduced and under the conditions of quantum mechanical measurements the rules of a dialog-game about quantum mechanical propositions are established. In the second part of the paper the quantum mechanical dialog-game is replaced by a calculus of quantum logic. As the main part of the paper we (...) show that the calculus of quantum logic is complete and consistent with respect to the dialogic semantics. Since the dialoggame does not involve the 'excluded middle' the calculus represents a calculus of effective (intuitionistic) quantum logic. In a forthcoming paper it is shown that this calculus is equivalent to a calculus of sequents and more interestingly to a calculus of propositions. With the addition of the 'excluded middle' the latter calculus is a model for the lattice of subspaces of a Hilbert space. (shrink)

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hubert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by their nondistributivity and by various other problems. We show that a possible resolution of these difficulties, suggested by the ideas of Bohr, emerges if instead of single projections one considers elementary propositions to (...) be families of projections indexed by a partially ordered set C(A) of appropriate commutative subalgebras of A. In fact, to achieve both maximal generality and ease of use within topos theory, we assume that A is a so-called Rickart C*-algebra and that C(A) consists of all unital commutative Rickart C*-subalgebras of A. Such families of projections form a Hey ting algebra in a natural way, so that the associated propositional logic is intuitionistic: distributivity is recovered at the expense of the law of the excluded middle. Subsequently, generalizing an earlier computation for n x n matrices, we prove that the Heyting algebra thus associated to A arises as a basis for the internal Gelfand spectrum (in the sense of Banaschewski-Mulvey) of the "Bohrification" A̱ of A, which is a commutative Rickart C*-algebra in the topos of functors from C(A) to the category of sets. We explain the relationship of this construction to partial Boolean algebras and Bruns-Lakser completions. Finally, we establish a connection between probability measures on the lattice of projections on a Hubert space H and probability valuations on the internal Gelfand spectrum of A̱ for A = B(H). (shrink)

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by their nondistributivity and by various other problems. We show that a possible resolution of these difficulties, suggested by the ideas of Bohr, emerges if instead of single projections one considers elementary propositions to (...) be families of projections indexed by a partially ordered set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}(A)}$$\end{document} of appropriate commutative subalgebras of A. In fact, to achieve both maximal generality and ease of use within topos theory, we assume that A is a so-called Rickart C*-algebra and that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}(A)}$$\end{document} consists of all unital commutative Rickart C*-subalgebras of A. Such families of projections form a Heyting algebra in a natural way, so that the associated propositional logic is intuitionistic: distributivity is recovered at the expense of the law of the excluded middle. Subsequently, generalizing an earlier computation for n × n matrices, we prove that the Heyting algebra thus associated to A arises as a basis for the internal Gelfand spectrum (in the sense of Banaschewski–Mulvey) of the “Bohrification” \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\underline A}$$\end{document} of A, which is a commutative Rickart C*-algebra in the topos of functors from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}A}$$\end{document} to the category of sets. We explain the relationship of this construction to partial Boolean algebras and Bruns–Lakser completions. Finally, we establish a connection between probability measures on the lattice of projections on a Hilbert space H and probability valuations on the internal Gelfand spectrum of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\underline A}$$\end{document} for A = B(H). (shrink)

This article proposes a basic logic for application in physics dispensing with the Principle of Excluded Middle. It is based on the article “Matrix Based Logics for Application in Physics (RMQ) which appeared 2009. In his article with Stachow on the Principle of Excluded Middle in Quantum Logic (QL), Peter Mittelstaedt showed that for some suitable QLs, including their own, the Principle of Excluded Middle can be added without any harm for QL; where ‘without any harm for (...) QL’ means that the basic desiderata and the basic results (theorems) of those QLs remain satised in the sense that they avoid the well known difficulties with commensurability and distributivity.In the following article I want to show that the basic desiderata and results (theorems) of RMQ (of avoiding the well-known difficulties with commensurability, distributivity, fusion and Bell’s inequalities) remain satised if by introducing a strong negation (or strong negation and disjunction) the resulting weak intuitionist system RMQI dispenses with the Principle of Excluded Middle; it becomes either invalid or not strictly valid. (shrink)

The interpretation of quantum mechanics has been a problem since its founding days. A large contribution to the discussion of possible interpretations of quantum mechanics is given by the so-called impossibility proofs for hidden variable models; models that allow a realist interpretation. In this thesis some of these proofs are discussed, like von Neumann’s Theorem, the Kochen-Specker Theorem and the Bell-inequalities. Some more recent developments are also investigated, like Meyer’s nullification of the Kochen-Specker Theorem, the MKC-models and Conway (...) and Kochen’s Free Will Theorem. This last one is taken to suggest that the problems that arise for certain interpretations of quantum mechanics are not limited to realist interpretations only, but also affect certain instrumentalist interpretations. It is argued that one may arrive at a more satisfying interpretation of quantum mechanics if one adopts a logic that seems more compatible with the instrumentalist viewpoint namely, intuitionistic logic. The motivations for adopting this form of logic rather than classical logic or quantum logic are linked to some of the philosophical ideas of Bohr. In particular a new interpretation of Bohr’s notion of complementarity is proposed. Finally some possibilities are explored for linking the intuitionistic interpretation of quantum mechanics to the mathematical formalism of the theory. (shrink)

At the 1927 Como conference Bohr spoke the famous words “It is wrong to think that the task of physics is to find out how nature is. Physics concerns what we can say about nature.” However, if the Copenhagen interpretation really adheres to this motto, why then is there this nagging feeling of conflict when comparing it with realist interpretations? Surely what one can say about nature should in a certain sense be interpretation independent. In this paper I take Bohr’s (...) motto seriously and develop a quantum logic that avoids assuming any form of realism as much as possible. To illustrate the non-triviality of this motto, a similar result is first derived for classical mechanics. It turns out that the logic for classical mechanics is a special case of the quantum logic thus derived. Some hints are provided as to how these logics are to be used in practical situations and finally, I discuss how some realist interpretations relate to these logics. (shrink)

In the framework of the topos approach to quantum mechanics we give a representation of physical properties in terms of modal operators on Heyting algebras. It allows us to introduce a classical type study of the mentioned properties.

The double slit experiment for a massive scalar particle is described using intuitionistic logic with quantum real numbers as the numerical values of the particle's position and momentum. The model assigns physical reality to single quantum particles. Its truth values are given open subsets of state space interpreted as the ontological conditions of a particle. Each condition determines quantum real number values for all the particle's attributes. Questions, unanswerable in the standard theories, concerning the behaviour (...) of single particles in the experiment are answered. (shrink)

We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterize B positively: reflection, symmetry and visibility. A logical constant obeys to the principle of reflection if it is characterized semantically by (...) an equation binding it with a metalinguistic link between assertions, and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection. To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cut-elimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube. (shrink)

This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the (...) subject of an especially detailed reform program. Finally, the fourth case study is paraconsistent logic, perhaps the most controversial of serious proposals. (shrink)

We introduce a sequent calculusBfor a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic. quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterizeBpositively: reflection, symmetry and visibility.A logical constant obeys to the principle of reflection if it is characterized semantically by an equation binding it with (...) a metalinguistic link between assertions, and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection.To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cut-elimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube. (shrink)

Constructivist epistemology posits that all truths are knowable. One might ask to what extent constructivism is compatible with naturalized epistemology and knowledge obtained from inference-making using successful scientific theories. If quantum theory correctly describes the structure of the physical world, and if quantum theoretic inferences about which measurement outcomes will be observed with unit probability count as knowledge, we demonstrate that constructivism cannot be upheld. Our derivation is compatible with both intuitionistic and quantum propositional logic. (...) This result is implied by the Frauchiger-Renner theorem, though it is of independent importance as well. (shrink)

In Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics—multi-valued, intuitionistic, paraconsistent (...) and quantum logics. Its purpose is to show that there is no particular domain or reason that demands the use of a non-classical logic; the particular reasons given for the non-classical logic can also be handled within classical logic. The result of Sect. 2 is substantiated in Sect. 3, where it is shown (referring to other work) that all four kinds of non-classical logics can be translated into classical logic in a meaning-preserving way. Based on this fact a justification of classical logic is developed in Sect. 4 that is based on its representational optimality. It is pointed out that not many but a few non-classical logics can be likewise representationally optimal. However, the situation is not symmetric: classical logic has ceteris paribus advantages as a unifying metalogic, while non-classical logics can have local simplicity advantages. (shrink)

In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value. Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and (...) quantum logics, can be translated into classical logic by introducing additional intensional operators into the language. Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Nevertheless the situation is not symmetric, because classical logic has important ceteris paribus advantages as a unifying metalogic. (shrink)

Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and show why it is helpful to (...) consider the instants of time as Fuzzy numbers. In physics, though there are revolutionary ideas on the time concept like B theories in contrast to A theory also about central concepts like space, momentum… it is a long time that these concepts are changed, but time is considered classically in all well-known and established physics theories. Seemingly, we stick to the classical time concept in all fields of science and we have a vast inertia to change it. Our goal in this article is to provide some bases why it is rational and reasonable to change and modify this picture. Here, the central point is the modified version of “Unexpected Hanging” paradox as it is described in "Is classical Mathematics appropriate for theory of Computation".This modified version leads us to a contradiction and based on that it is presented there why some problems in Theory of Computation are not solved yet. To resolve the difficulties arising there, we have two choices. Either “choosing” a new type of Logic like “Para-consistent Logic” to tolerate contradiction or changing and improving the time concept and consequently to modify the “Turing Computational Model”. Throughout this paper, we select the second way for benefiting from saving some aspects of Classical Logic. In chapter 2, by applying quantum Mechanics and Schrodinger equation we compute the associated fuzzy number to time. (shrink)

Topos quantum theory represents a whole new approach to the formalization of non-relativistic quantum theory. It is well known that TQT replaces the orthomodular quantum logic of the traditional Hilbert space formalism with a new intuitionistic logic that arises naturally from the topos theoretic structure of the theory. However, it is less well known that TQT also has a dual logical structure that is paraconsistent. In this paper, we investigate the relationship between these two (...) logical structures and study the implications of this relationship for the definition of modal operators in TQT. (shrink)

In the chapter on quantum logic in Volume 6 of Handbook of Philosophical Logic, Dalla Chiara and Giuntini make an interesting observation that there is a unified relational semantics underlying both the {¬,∧}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{ {\lnot }, {\wedge } \}$$\end{document}-fragment of intuitionistic logic and ortho-logic. In this paper, we contribute to a systematic investigation of this relational semantics by providing an axiomatization of its logic.

The article presents a brief analysis of how the existence of various logics became possi­ble. This is shown on the example of such well-known logical theories as syllogistics, temporal, multivalued, intuitionistic, paraconsistent and quantum logics. Each of them arose not on someone’s whim, but to solve specific problems. They are based on the most general ontological assumptions about the subject area under study. In formal logic onto­logical assumptions are refined in the concept of a model structure. Since (...) it is impossible to talk about logic in isolation from the language used, the most general epistemic as­sumptions about the nature of the relationship of linguistic expressions to those objects of extralinguistic reality that they represent are also accepted. One of the most important of these relationships is the concept of the truth of sentences, which was first formulated by Plato and Aristotle. Taking certain ontological and epistemic assumptions depending on the problem being solved, we obtain different logics. Process logic is primarily char­acterized by special ontological assumptions that are fundamentally different from the as­sumptions of other currently existing logics. The ontology of processes is an ontology of developing processes, not things. Historically, it was most vividly described in the writings of Heraclitus. In the overwhelming majority of modern approaches to the de­scription of processes, we see attempts to reduce them to sequences of states, which de­values the very concept of a process, just as a cinematic picture of the flow of time deval­ues the concept of time. Since logics are built on the basis of various ontological and epistemic assumptions, they are inherently theories of these accepted assumptions, and not universal reasoning tools that don’t depend on the characteristics of the study area and the categories of linguistic expressions. Universal logic is possible if one rises from the level of specific languages to a higher level of sign theory. (shrink)

Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first constructive version of hybrid logic, thereby showing that it is possible to hybridize constructive modal logics. Alternative systems are discussed, but we fix on a reasonable and well-motivated version of intuitionistic hybrid logic and prove essential proof-theoretical results for a natural deduction formulation of it. Our natural deduction system is also extended (...) with additional inference rules corresponding to conditions on the accessibility relations expressed by so-called geometric theories. Thus, we give natural deduction systems in a uniform way for a wide class of constructive hybrid logics. This shows that constructive hybrid logics are a viable enterprise and opens up the way for future applications. (shrink)

The present work is motivated by two questions. (1) What should an intuitionistic epistemic logic look like? (2) How should one interpret the knowledge operator in a Kripke-model for it? In what follows we outline an answer to (2) and give a model-theoretic definition of the operator K. This will shed some light also on (1), since it turns out that K, defined as we do, fulfills the properties of a necessity operator for a normal modal logic. (...) The interest of our construction also lies in a better insight into the intuitionistic solution to Fitch's paradox, which is discussed in the third section. In particular we examine, in the light of our definition, De Vidi and Solomon's proposal of formulating the verification thesis as Φ → ¬¬KΦ. We show, as our main result, that this definition excapes the paradox, though it is validated only under restrictive conditions on the models. (shrink)

Intuitionistic propositional logic with Galois negations ( \(\mathsf {IGN}\) ) is introduced. Heyting algebras with Galois negations are obtained from Heyting algebras by adding the Galois pair \((\lnot,{\sim })\) and dual Galois pair \((\dot{\lnot },\dot{\sim })\) of negations. Discrete duality between GN-frames and algebras as well as the relational semantics for \(\mathsf {IGN}\) are developed. A Hilbert-style axiomatic system \(\mathsf {HN}\) is given for \(\mathsf {IGN}\), and Galois negation logics are defined as extensions of \(\mathsf {IGN}\). We give (...) the bi-tense logic \(\mathsf {S4N}_t\) which is obtained from the minimal tense extension of the modal logic \(\mathsf {S4}\) by adding tense operators. We give a new extended Gödel translation \(\tau \) and prove that \(\mathsf {IGN}\) is embedded into \(\mathsf {S4N}_t\) by \(\tau \). Moreover, every Kripke-complete Galois negation logic _L_ is embedded into its tense companion \(\tau (L)\). (shrink)

The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set-theory (...) or intuitionist approach to the foundation of mathematics and to Peano or Heyting arithmetic. Quantum mechanics can be reformulated in terms of information introducing the concept and quantity of quantum information. A qubit can be equivalently interpreted as that generalization of “bit” where the choice is among an infinite set or series of alternatives. The complex Hilbert space can be represented as both series of qubits and value of quantum information. The complex Hilbert space is that generalization of Peano arithmetic where any natural number is substituted by a qubit. “Negation”, “choice”, and “infinity” can be inherently linked to each other both in the foundation of mathematics and quantum mechanics by the meditation of “information” and “quantum information”. (shrink)

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the "quantum logic" of subspaces of a general vector space--which is then specialized to the closed subspaces of a Hilbert space. But there is a "dual" progression. The notion of a partition (or quotient set or equivalence relation) is (...) dual (in a category-theoretic sense) to the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of partitions to the quantum logic of direct-sum decompositions (i.e., the vector space version of a set partition) of a general vector space--which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the logic to express measurement by any self-adjoint operators rather than just the projection operators associated with subspaces. In this introductory paper, the focus is on the quantum logic of direct-sum decompositions of a finite-dimensional vector space (including such a Hilbert space). The primary special case examined is finite vector spaces over ℤ₂ where the pedagogical model of quantum mechanics over sets (QM/Sets) is formulated. In the Appendix, the combinatorics of direct-sum decompositions of finite vector spaces over GF(q) is analyzed with computations for the case of QM/Sets where q=2. (shrink)

We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear "no". Philosophically, our argument is based on combining a formal semantic approach, in the spirit of E. W. Beth's proposal of applying Tarski's semantical methods to the analysis of physical (...) theories, with an empirical-experimental approach to Logic, as advocated by both Beth and Putnam, but understood by us in the view of the operationalrealistic tradition of Jauch and Piron, i. e. as an investigation of "the logic of yes-no experiments" (or "questions"). Technically, we use the recently-developed setting of Quantum Dynamic Logic (Baltag and Smets 2005, 2008) to make explicit the operational meaning of quantum-mechanical concepts in our formal semantics. Based on our recent results (Baltag and Smets 2005), we show that the correct interpretation of quantum-logical connectives is dynamical, rather than purely propositional. We conclude that there is no contradiction between classical logic and (our dynamic reinterpretation of) quantum logic. Moreover, we argue that the Dynamic-Logical perspective leads to a better and deeper understanding of the "non-classicality" of quantum behavior than any perspective based on static Propositional Logic. (shrink)

In this work, an intuitionistic propositional logic with a Galois connection is introduced. In addition to the intuitionistic logic axioms and inference rule of modus ponens, the logic contains only two rules of inference mimicking the performance of Galois connections. Both Kripke-style and algebraic semantics are presented for IntGC, and IntGC is proved to be complete with respect to both of these semantics. We show that IntGC has the finite model property and is decidable, but (...) Glivenko's Theorem does not hold. Duality between algebraic and Kripke semantics is presented, and a representation theorem for Heyting algebras with Galois connections is proved. In addition, an application to rough L-valued sets is presented. (shrink)

Building on recent work by Yale Weiss, we study conditional logics in the intuitionistic setting. We consider a number of semantic conditions which give rise, among others, to intuitionistic counterparts of Lewis’s logic VC and Stalnaker’s C2. We show how to obtain a sound and complete axiomatization of each logic arising from a combination of these conditions. On the way, we remark how, in the intuitionistic setting, certain classically equivalent principles of conditional logic come (...) apart, and how certain logical connections between different principles no longer hold. (shrink)

Paraconsistent quantum logics are weak forms of quantum logic, where the noncontradiction and the excluded-middle laws are violated. These logics find interesting applications in the operational approach to quantum mechanics. In this paper, we present an axiomatization, a Kripke-style, and an algebraic semantical characterization for two forms of paraconsistent quantum logic. Further developments are contained in Giuntini and Greuling's paper in this issue.

We examine second order intuitionistic propositional logic, IPC². Let $F_\exists $ be the set of formulas with no universal quantification. We prove Glivenko's theorem for formulas in $F_\exists $ that is, for φ € $F_\exists $ φ is a classical tautology if and only if ¬¬φ is a tautology of IPC². We show that for each sentence φ € $F_\exists $ (without free variables), φ is a classical tautology if and only if φ is an intuitionistic tautology. (...) As a corollary we obtain a semantic argument that the quantifier V is not definable in IPC² from ⊥, V, ^, →. (shrink)

This paper gives a formulation of quantum logic in the abstract algebraic setting laid out by Dunn and Hardegree (2001). On this basis, it provides a comparative analysis of viable quantum logical bivalent semantics and their classical counterparts, thereby showing that the truth-functional status of classical and quantum connectives is not as different as usually thought. Then it points out that bivalent semantics for quantum logic - compatible with realism about quantum mechanics - (...) can be maintained, albeit at the price of truth-functionality. Finally, the paper improves on Hellman (1980)'s argument that this lack of truth-functionality entails a change of meaning between classical and quantum logical connectives. (shrink)

One of the most interesting programs in the foundations of quantum mechanics is the realist quantum logic approach associated with Putnam, Bub, Demopoulos and Friedman (and which is the focus of my own research.) I believe that realist quantum logic is our best hope for making sense of quantum mechanics, but I have come to suspect that the usual version may not be the correct one. In this paper, I would like to say why (...) and to propose an alternative. (shrink)

, Rudolf Carnap became a chief proponent of the doctrine that the statements of intuitionism carry nonstandard intuitionistic meanings. This doctrine is linked to Carnap's ‘Principle of Tolerance’ and claims he made on behalf of his notion of pure syntax. From premises independent of intuitionism, we argue that the doctrine, the Principle, and the attendant claims are mistaken, especially Carnap's repeated insistence that, in defining languages, logicians are free of commitment to mathematical statements intuitionists would reject. I am grateful (...) to Nathan Carter, Gary Ebbs, Janet Folina, Luise Prior McCarty, Stewart Shapiro, Neil Tennant, Christopher Tillman, Beth Tropman, Wen-fang Wang, and two anonymous referees for their comments and suggestions. CiteULike Connotea Del.icio.us What's this? (shrink)

Routley- Meyer type relational complete semantics are constructed for intuitionistic contractionless logic with reductio. Different negation completions of positive intuitionistic logic without contraction are treated in a systematical, unified and semantically complete setting.