An axiomatization of the finite-valued Łukasiewicz calculus

In this paper the completeness theorems for the finite-valued ukasiewicz logics are proved with the use of the Lindenbaum algebra.The research was sponsored by the grant C.P.B.P. 08-15.I wish to thank Dr hab. Piotr Wojtylak for ideas and suggestions which enabled me to write this paper.     

Systems of Quantum Logic

Logical implications are closely related to modal operators. Lattice-valued logic LL and quantum logic QL were formulated in Titani S (1999) Lattice Valued Set Theory. Arch Math Logic 38:395–421, Titani S (2009) A Completeness Theorem of Quantum Set Theory. In: Engesser K, Gabbay DM, Lehmann D (eds) Handbook of Quantum Logic and Quantum Structures: Quantum Logic. Elsevier Science Ltd., pp. 661–702, by introducing the basic implication → which represents the lattice order. In this paper, we fomulate a predicate orthologic provided with the basic implication, which corresponds to complete ortholattices, and then formulate a quantum logic which is equivalent to QL, by using a modal operator instead of the basic implication.     

Algebraic Characterizations of Various Beth Definability Properties

In this paper it will be shown that the Beth definability property corresponds to surjectiveness of epimorphisms in abstract algebraic logic. This generalizes a result by I. Németi (cf. [11, Theorem 5.6.10]). Moreover, an equally general characterization of the weak Beth property will be given. This gives a solution to Problem 14 in [20]. Finally, the characterization of the projective Beth property for varieties of modal algebras by L. Maksimova (see [15]) will be shown to hold for the larger class of semantically algebraizable logics.     

Measuring coherence using LP-models

This paper introduces a technique for measuring the degree of (in)coherence of inconsistent sets of propositional formulas. The coherence of these sets of formulas is calculated using the minimal models of those sets in G. Priest's Logic of Paradox. The compatibility of the information expressed by a set of formulas with the background or domain knowledge can also be measured with this technique. In this way, Hunter's objections to many-valued paraconsistent logics as instruments for measuring (in)coherence are addressed.     

The dynamic turn in quantum logic

In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the ??dynamic turn?? in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the logical foundations of Quantum Physics, and in particular the area known as Operational Quantum Logic, as developed by Jauch and Piron (Helve Phys Acta 42:842?C848, 1969), Piron (Foundations of Quantum Physics, 1976). By bringing these areas together we explain the basic ingredients of Dynamic Quantum Logic, a new direction of research in the logical foundations of physics.     

Three Complexity Problems in Quantified Fuzzy Logic

We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in [H01].     

A Non-Abelian, Categorical Ontology of Spacetimes and Quantum Gravity

A non-Abelian, Universal SpaceTime Ontology is introduced in terms of Categories, Functors, Natural Transformations, Higher Dimensional Algebra and the Theory of Levels. A Paradigm shift towards Non-Commutative Spacetime structures with remarkable asymmetries or broken symmetries, such as the CPT-symmetry violation, is proposed. This has the potential for novel applications of Higher Dimensional Algebra to SpaceTime structure determination in terms of universal, topological invariants of ‘hidden’ symmetry. Fundamental concepts of Quantum Algebra and Quantum Algebraic Topology, such as Quantum Groups, von Neumann and Hopf Algebras are first considered with a view to their possible extensions and future applications in Quantum Field theories. New, non-Abelian results may be obtained through Higher Homotopy, General van Kampen Theorems, Lie Groupoids/Algebroids and Groupoid Atlases, possibly with novel applications to Quantum Dynamics and Local-to-Global Problems, Quantum Logics and Logic Algebras. Many-valued Logics, ?ukasiewicz–Moisil Logics lead to Generalized LM-Toposes as global representations of SpaceTime Structures in the presence of intense Quantum Gravitational Fields. Such novel representations have the potential to develop a Quantum/General Relativity Theory in the context of Supersymmetry, Supergravity, Supersymmetry Algebras and the Metric Superfield in the Planck limit of spacetime. Quantum Gravity and Physical Cosmology issues are also considered here from the perspective of multiverses, thus leading also to novel types of Generalized, non-Abelian, Topological, Higher Homotopy Quantum Field Theories (HHQFT) and Non-Abelian Quantum Algebraic Topology (NA-QAT) theories.     

R⌝-algebras and R⌝-model structures as power constructs

In relevance logic it has become commonplace to associate with each logic both an algebraic counterpart and a relational counterpart. The former comes from the Lindenbaum construction; the latter, called a model structure, is designed for semantical purposes. Knowing that they are related through the logic, we may enquire after the algebraic relationship between the algebra and the model structure. This paper offers a complete solution for the relevance logic R. Namely, R-algebras and R-model structures can be obtained from each other, and represented in terms of each other, by application of power constructions.This paper was presented at the 1986 Annual Conference of the Australasian Association of Logic in Auckland, 9–12 July, 1986.     

Logics of Informational Interactions

The pre-eminence of logical dynamics, over a static and purely propositional view of Logic, lies at the core of a new understanding of both formal epistemology and the logical foundations of quantum mechanics. Both areas appear at first sight to be based on purely static propositional formalisms, but in our view their fundamental operators are essentially dynamic in nature. Quantum logic can be best understood as the logic of physically-constrained informational interactions (in the form of measurements and entanglement) between subsystems of a global physical system. Similarly, (multi-agent) epistemic logic is the logic of socially-constrained informational interactions (in the form of direct observations, learning, various forms of communication and testimony) between “subsystems” of a social system. Dynamic Epistemic Logic (DEL) provides us with a unifying setting in which these informational interactions, coming from seemingly very different areas of research, can be fully compared and analyzed. The DEL formalism comes with a powerful set of tools that allows us to make the underlying dynamic/interactive mechanisms fully transparent.     

一个关于非直谓语句的逻辑系统

非直谓现象普遍存在于许多领域中。在数学中,对集合的最小元的定义是非直谓的。在逻辑中,罗素悖论的产生是由于允许非直谓地定义一个集合,即“所有不包含它自身的集合的集合”。莱布尼兹对“同一性”的定义——“a与b是相同实体当且仅当对所有性质f,如果f（a）则f（b）,反之亦然”——是非直谓的。罗素构造分歧类型论的动机不是来自形式系统的悖论,而是来自日常语言中的悖论。本文的目标是构造一文化景观命题逻辑来刻画关于特定的非直谓语句的推理。一个非直谓语句的表达预设了一个语句集,一个典型的非直谓语句是“拿破仑具备一名伟人将军的所有德性”（罗素的例子）。本文所关注的是“一阶”非直谓语句,即仅预设直谓语句集的非直谓语句。非直谓语句的一个性质是：一个非直谓语句等价于它所预设的语句集中的成员（可能无穷）的合取。这一性质需要在要构造的逻辑系统的句法中被表达出来,而针对此本文所采用的手段是在命题逻辑系统的符号中加入“命题量词”,也就是说本文要构造一个量化命题逻辑系统。在形式化部分,本文给出了这个逻辑的句法、语义、希尔伯特公理系统和它的完全性证明。     

From Wittgenstein’s N-operator to a New Notation for Some Decidable Modal Logics

Wittgenstein’s N-operator is a ‘primitive sign’ which shows every complex proposition is the result of the truth-functional combination of a finite number of component propositions, and thus provides a mechanical method to determine logical truth. The N-operator can be interpreted as a generalized Sheffer stroke. In this paper, I introduce a new ‘primitive sign’ that is a hybrid of generalized Sheffer stroke and modality, and give a uniform expression for modal formulas. The general form of modal formula in the new notation is [A₀···A_n?1; B₀···B_m?1], which is semantically equivalent to ¬A₀∨···∨¬ A_n?1∨? (¬B₀∨···∨¬B_m?1). Based on this new notation, I propose several analytic axiomatic systems for some decidable modal logics. Every axiom of these analytic systems is an ‘Atomic-Sheffer’, which is the result of the combination of a finite number of component propositions. The inferential rules are analytic in that the set of elementary propositions that are combined in the premiss overlaps the set of elementary propositions combined in the conclusion, in virtue of which every complex proposition can be reduced to an ‘Atomic-Sheffer’ at the ultimate level. The analytic modal systems have the same classical inferential rules. Different modal systems can be built by adding special modal inferential rules. In an analytic system for modal logic L, valid formulas on L-models can be proved by a purely mechanical method.     

论模态逻辑的集合论语义

引入非良基集合可以为模态逻辑提供一种新的语义学。这种语义是在集合上解释模态语言,使用集合中作为元素的集合之间的属于关系解释模态词,并在集合中采用命题变元作为本元,从而解释原子命题的真假。在这种新的语义下,从模型构造的角度看可以引入几种非标准的集合运算：不交并、生成子集合、p-态射、树展开等等,证明模态公式在这些运算下的保持或不变结果。利用这些结果还可以证明一些集合类不是模态可定义的。     

On Retaining Classical Truths and Classical Deducibility in Many-Valued and Fuzzy Logics

In this paper, I identify the source of the differences between classical logic and many-valued logics (including fuzzy logics) with respect to the set of valid formulas and the set of inferences sanctioned. In the course of doing so, we find the conditions that are individually necessary and jointly sufficient for any many-valued semantics (again including fuzzy logics) to validate exactly the classically valid formulas, while sanctioning exactly the same set of inferences as classical logic. This in turn shows, contrary to what has sometimes been claimed, that at least one class of infinite-valued semantics is axiomatizable.     

Truth versus testability in Quantum Logic

We forward an epistemological perspective regarding non-classical logics which restores the universality of logic in accordance with the thesis of global pluralism. In this perspective every non-classical truth-theory is actually a theory of some metalinguistic concept which does not coincide with the concept of truth (described by Tarski's truth theory). We intend to apply this point of view to Quantum Logic (QL) in order to prove that its structure properties derive from properties of the metalinguistic concept of testability in Quantum Physics. To this end we construct a classical language L _cand endow it with a classical effective interpretation which is partially inspired by the Ludwig approach to the foundations of Quantum Mechanics. Then we select two subsets of formulas in L _cwhich can be considered testable because of their interpretation and we show that these subsets have the structure properties of Quantum Logics because of Quantum Mechanical axioms, as desired. Finally we comment on some relevant consequences of our approach (in particular, the fact that no non-classical logic is strictly needed in Quantum Physics).     

The logic of questions as a theory of erotetic arguments

This paper argues for the idea that the logic of questions should focus its attention on the analysis of arguments in which questions play the role of conclusions. The relevant concepts of validity are discussed and the concept of the logic of questions of a semantically interpreted formalized language is introduced.This paper was presented at the symposium Erotetic Logic. A Dialogue organized by the Center for the Philosophy and History of Science of Boston University (February, 1994) and prepared during my stay at the Department of Philosophy, University of California, Riverside as a Fulbright grantee.I would like to thank Professors David Harrah and Sylvain Bromberger for valuable suggestions and comments.     

Compound fracture: the role of semantic transparency and morphological headedness

This paper explores the role of semantic transparency in the representation and processing of English compounds. We focus on the question of whether semantic transparency is best viewed as a property of the entire multimorphemic string or as a property of constituent morphemes. Accordingly, we investigated the processing of English compound nouns that were categorized in terms of the semantic transparency of each of their constituents. Fully transparent such as bedroom are those in which the meanings of each of the constituents are transparently represented in the meaning of the compound as a whole. These compounds were contrasted with compounds such as strawberry, in which only the second constituent is semantically transparent, jailbird, in which only the first constituent is transparent, and hogwash, in which neither constituent is semantically transparent. We propose that significant insights can be achieved through such analysis of the transparency of individual morphemes. The two experiments that we report present evidence that both semantically transparent compounds and semantically opaque compounds show morphological constituency. The semantic transparency of the morphological head (the second constituent in a morphologically right-headed language such as English) was found to play a significant role in overall lexical decision latencies, in patterns of decomposition, and in the effects of stimulus repetition within the experiment.     

Part-set cueing and lexical decisions: Testing an inhibitory account

Providing some elements of a studied set during testing (part-set cues) can impair memory for the remaining elements (noncues)—a counterintuitive effect that has recently been attributed to inhibition of noncues. To test for such inhibition using a lexical decision task, we manipulated semantic and episodic relationships, such that cues and noncues were related only semantically, only episodically, or both semantically and episodically. Results showed that part-set cueing evoked inhibition, slowing lexical decisions for noncues that were related to cues both semantically and episodically, consistent with previous results involving the retrieval practice paradigm. However, either type of relationship alone was insufficient to slow decisions, despite previous evidence of impaired memory in similar conditions when tested with other measures such as free recall. The latter results raise questions regarding the extent to which inhibition can account for cueing-induced impairment when cues and noncues are related only semantically or only episodically.     

Big toy models

We pursue a model-oriented rather than axiomatic approach to the foundations of Quantum Mechanics, with the idea that new models can often suggest new axioms. This approach has often been fruitful in Logic and Theoretical Computer Science. Rather than seeking to construct a simplified toy model, we aim for a ??big toy model??, in which both quantum and classical systems can be faithfully represented??as well as, possibly, more exotic kinds of systems. To this end, we show how Chu spaces can be used to represent physical systems of various kinds. In particular, we show how quantum systems can be represented as Chu spaces over the unit interval in such a way that the Chu morphisms correspond exactly to the physically meaningful symmetries of the systems??the unitaries and antiunitaries. In this way we obtain a full and faithful functor from the groupoid of Hilbert spaces and their symmetries to Chu spaces. We also consider whether it is possible to use a finite value set rather than the unit interval; we show that three values suffice, while the two standard possibilistic reductions to two values both fail to preserve fullness.