Completeness of quantum logic

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 dialog-game 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.On leave of absence from the Institut für Theoretische Physik der Universität zu Köln, W.-Germany.     

Three-valued Logic,Indeterminacy and Quantum Mechanics

The paper consists of two parts. The first part begins with the problem of whether the original three-valued calculus, invented by J. ukasiewicz, really conforms to his philosophical and semantic intuitions. I claim that one of the basic semantic assumptions underlying ukasiewicz's three-valued logic should be that if under any possible circumstances a sentence of the form X will be the case at time t is true (resp. false) at time t, then this sentence must be already true (resp. false) at present. However, it is easy to see that this principle is violated in ukasiewicz's original calculus (as the cases of the law of excluded middle and the law of contradiction show). Nevertheless it is possible to construct (either with the help of the notion of supervaluation, or purely algebraically) a different three-valued, semi-classical sentential calculus, which would properly incorporate ukasiewicz's initial intuitions. Algebraically, this calculus has the ordinary Boolean structure, and therefore it retains all classically valid formulas. Yet because possible valuations are no longer represented by ultrafilters, but by filters (not necessarily maximal), the new calculus displays certain non-classical metalogical features (like, for example, non-extensionality and the lack of the metalogical rule enabling one to derive p is true or q is true from pqq is true).The second part analyses whether the proposed calculus could be useful in formalizing inferences in situations, when for some reason (epistemological or ontological) our knowledge of certain facts is subject to limitation. Special attention should be paid to the possibility of employing this calculus to the case of quantum mechanics. I am going to compare it with standard non-Boolean quantum logic (in the Jauch–Piron approach), and to show that certain shortcomings of the latter can be avoided in the former. For example, I will argue that in order to properly account for quantum features of microphysics, we do not need to drop the law of distributivity. Also the idea of reading off the logical structure of propositions from the structure of Hilbert space leads to some conceptual troubles, which I am going to point out. The thesis of the paper is that all we need to speak about quantum reality can be acquired by dropping the principle of bivalence and extensionality, while accepting all classically valid formulas.     

Disjunctive Quantum Logic in Dynamic Perspective

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.     

First-order fuzzy logic

This paper is an attempt to develop the many-valued first-order fuzzy logic. The set of its truth, values is supposed to be either a finite chain or the interval 0, 1 of reals. These are special cases of a residuated lattice L, , , , , 1, 0. It has been previously proved that the fuzzy propositional logic based on the same sets of truth values is semantically complete. In this paper the syntax and semantics of the first-order fuzzy logic is developed. Except for the basic connectives and quantifiers, its language may contain also additional n-ary connectives and quantifiers. Many propositions analogous to those in the classical logic are proved. The notion of the fuzzy theory in the first-order fuzzy logic is introduced and its canonical model is constructed. Finally, the extensions of Gödel's completeness theorems are proved which confirm that the first-order fuzzy logic is also semantically complete.     

Quantum logical calculi and lattice structures

In a preceding paper [1] it was shown that quantum logic, given by the tableaux-calculus T _eff, 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.     

What is the upper part of the lattice of bimodal logics?

We define an embedding from the lattice of extensions ofT into the lattice of extensions of the bimodal logic with two monomodal operators ₁ and ₂, whose ₂-fragment isS5 and ₁-fragment is the logic of a two-element chain. This embedding reflects the fmp, decidability, completenes and compactness. It follows that the lattice of extension of a bimodal logic can be rather complicated even if the monomodal fragments of the logic belong to the upper part of the lattice of monomodal logics.Presented byWolfgang Rautenberg     

Intensional Completeness in an Extension of Gödel/Dummett Logic

We enrich intuitionistic logic with a lax modal operator and define a corresponding intensional enrichment of Kripke models M = (W, , V) by a function T giving an effort measure T(w, u) {} for each -related pair (w, u). We show that embodies the abstraction involved in passing from true up to bounded effort to true outright. We then introduce a refined notion of intensional validity M |= p : and present a corresponding intensional calculus iLC-h which gives a natural extension by lax modality of the well-known G: odel/Dummett logic LC of (finite) linear Kripke models. Our main results are that for finite linear intensional models L the intensional theory iTh(L) = {p : | L |= p : } characterises L and that iLC-h generates complete information about iTh(L).Our paper thus shows that the quantitative intensional information contained in the effort measure T can be abstracted away by the use of and completely recovered by a suitable semantic interpretation of proofs.     

Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?

The main result of this paper belongs to the field of the comparative study of program verification methods as well as to the field called nonstandard logics of programs. We compare the program verifying powers of various well-known temporal logics of programs, one of which is the Intermittent Assertions Method, denoted as Bur. Bur is based on one of the simplest modal logics called S5 or sometime-logic. We will see that the minor change in this background modal logic increases the program verifying power of Bur. The change can be described either technically as replacing the reflexive version of S5 with an irreflexive version, or intuitively as using the modality some-other-time instead of sometime. Some insights into the nature of computational induction and its variants are also obtained.This project was supported by the Hungarian National Foundation for Scientific Research, Grant No. 1810.     

On the non-availability of Dawson-modeling into certain relevance alethic modal logics

This paper shows that the Dawson technique of modelling deontic logics into alethic modal logics to gain insight into deontic formulas is not available for modelling a normal (in the spirit of Anderson) relevance deontic modal logic into either of the normal relevance alethic modal logics R _S4or R _M. The technique is to construct an extension of the well known entailment matrix set M ₀and show that the model of the deontic formula P (A v B). PA v PB is excluded.     

A note on the normal form of closed formulas of interpretability logic

Each closed (i.e. variable free) formula of interpretability logic is equivalent in ILF to a closed formula of the provability logic G, thus to a Boolean combination of formulas of the form ⁿ.     

Completeness theorem for dummett's LC quantified and some of its extensions

Dummett's logic LC quantified, Q-LC, is shown to be characterized by the extended frame Q⁺, ,D, where Q⁺ is the set of non-negative rational numbers, is the numerical relation less or equal then and D is the domain function such that for all v, w Q⁺, D_v and if v w, then D _v . D _v D _w . Moreover, simple completeness proofs of extensions of Q-LC are given.     

Hemingway's Aging Heroes and the Concept of Phronesis

This article explores the concept of phronesis (practical wisdom) in four aging protagonists in Ernest Hemingway's works ranging from the short story A Clean Well-Lighted Place to the novella The Old Man and the Sea. Phronesis represents an understanding of the ways of the world, an acute sensitivity to a critical logic of human existence that can be attained only through extensive experience and suffering. The four aging protagonists are examples of Hemingway's definition of aging productively and profitably by purchasing an inner peace that consists of an intuitive system of continuous adjustment to the exigencies of daily living.     

Cut-free sequent and tableau systems for propositional Diodorean modal logics

We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved are always bounded by a finite set of formulaeX* _L depending only onX and the logicL. Thus each system gives a nondeterministic decision procedure for the logic in question. The completeness proofs yield deterministic decision procedures for each logic because each proof is constructive.Each tableau system has a cut-free sequent analogue proving that Gentzen's cut-elimination theorem holds for these latter systems. The techniques are due to Hintikka and Rautenberg.Presented byDov M. Gabbay     

Reasoning and logic

Gilbert Harman, in Logic and Reasoning (Synthese 60 (1984), 107–127) describes an unsuccessful attempt ... to develop a theory which would give logic a special role in reasoning. Here reasoning is psychological, a procedure for revising one's beliefs. In the present paper, I construe reasoning sociologically, as a process of linguistic interaction; and show how both reasoning in the psychologistic sense and logic are related to that process.     

On a certain class ofm-address machines

Conclusion It follows from the proved theorems that ifM =Q, (whereQ={0,q ₁,q ₂,...,q }) is a machine of the classM _F then there exist machinesM _i such thatM _i(1,c)=M (q _i,c) andQ _i={0, 1, 2, ..., +1} (i=1, 2, ..., ).And thus, if the way in which to an initial function of content of memorycC a machine assigns a final onecC is regarded as the only essential property of the machine then we can deal with the machines of the formM ={0, 1, 2, ..., }, and processes (t) (wheret=1,c,cC) only.Such approach can simplify the problem of defining particular machines of the classM _F , composing and simplifying them.Allatum est die 19 Januarii 1970     

Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers p, p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most , the resulting logics are decidable. This provides a partial answer to a question by Kremer. The result also transfers to modal S4 and some Gödel–Dummett logics with quantifiers over propositions.     

Fuzzy intuitionistic quantum logics

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 ³) is proved. A phisical interpretation of these logics can be constructed in the framework of the unsharp approach to quantum theory.     

A pragmatic interpretation of intuitionistic propositional logic

We construct an extension ^P of the standard language of classical propositional logic by adjoining to the alphabet of a new category of logical-pragmatic signs. The well formed formulas of are calledradical formulas (rfs) of ^P;rfs preceded by theassertion sign constituteelementary assertive formulas of ^P, which can be connected together by means of thepragmatic connectives N, K, A, C, E, so as to obtain the set of all theassertive formulas (afs). Everyrf of ^P is endowed with atruth value defined classically, and everyaf is endowed with ajustification value, defined in terms of the intuitive notion of proof and depending on the truth values of its radical subformulas. In this framework, we define the notion ofpragmatic validity in ^P and yield a list of criteria of pragmatic validity which hold under the assumption that only classical metalinguistic procedures of proof be accepted. We translate the classical propositional calculus (CPC) and the intuitionistic propositional calculus (IPC) into the assertive part of ^P and show that this translation allows us to interpret Intuitionistic Logic as an axiomatic theory of the constructive proof concept rather than an alternative to Classical Logic. Finally, we show that our framework provides a suitable background for discussing classical problems in the philosophy of logic.This paper is an enlarged and entirely revised version of the paper by Dalla Pozza (1991) worked out in the framework of C.N.R. project n. 89.02281.08, and published in Italian. The basic ideas in it have been propounded since 1986 by Dalla Pozza in a series of seminars given at the University of Lecce and in other Italian Universities. C. Garola collected the scattered parts of the work, helped in solving some conceptual difficulties and refining the formalism, yielded the proofs of some propositions (in particular, in Section 3) and provided physical examples (see in particular Remark 2.3.1).     

A cut-free gentzen-type system for the logic of the weak law of excluded middle

The logic of the weak law of excluded middleKC _p is obtained by adding the formula A A as an axiom scheme to Heyting's intuitionistic logicH _p . A cut-free sequent calculus for this logic is given. As the consequences of the cut-elimination theorem, we get the decidability of the propositional part of this calculus, its separability, equality of the negationless fragments ofKC _p andH _p , interpolation theorems and so on. From the proof-theoretical point of view, the formulation presented in this paper makes clearer the relations betweenKC _p ,H _p , and the classical logic. In the end, an interpretation of classical propositional logic in the propositional part ofKC _p is given.     

An almost general splitting theorem for modal logic

Given a normal (multi-)modal logic a characterization is given of the finitely presentable algebras A whose logics L A split the lattice of normal extensions of . This is a substantial generalization of Rautenberg [10] and [11] in which is assumed to be weakly transitive and A to be finite. We also obtain as a direct consequence a result by Blok [2] that for all cycle-free and finite A L A splits the lattice of normal extensions of K. Although we firmly believe it to be true, we have not been able to prove that if a logic splits the lattice of extensions of then is the logic of an algebra finitely presentable over ; in this respect our result remains partial.