For a finite von Neumann algebra factor M, the projections form a modular ortholattice L(M). We show that the equational theory of L(M) coincides with that of some resp. all L(ℂ n × n ) and is decidable. In contrast, the uniform word problem for the variety generated by all L(ℂ n × n ) is shown to be undecidable.

The purpose of this paper is to present an algebraic generalization of the traditional two-valued logic. This involves introducing a theory of automorphism algebras, which is an algebraic theory of many-valued logic having a complete lattice as the set of truth values. Two generalizations of the two-valued case will be considered, viz., the finite chain and the Boolean lattice. In the case of the Boolean lattice, on choosing a designated lattice value, this algebra has binary retracts that have the usual (...) axiomatic theory of the propositional calculus as suitable theory. This suitability applies to the Boolean algebra of formalized token models [2] where the truth values are, for example, vocabularies. Finally, as the actual motivation for this paper, we indicate how the theory of formalized token models [2] is an example of a many-valued predicate calculus. (shrink)

It is known that propositional relevant logics can be conservatively extended by the addition of a Heyting (intuitionistic) implication connective. We show that this same conservativity holds for a range of first-order relevant logics with strong identity axioms, using an adaptation of Fine’s stratified model theory. For systems without identity, the question of conservatively adding Heyting implication is thereby reduced to the question of conservatively adding the axioms for identity. Some results in this direction are also obtained. The conservative presence (...) of Heyting implication allows the development of an alternative model theory for quantified relevant logics. (shrink)

Measurement is a process aimed at acquiring and codifying information about properties of empirical entities. In this paper we provide an interpretation of such a process comparing it with what is nowadays considered the standard measurement theory, i.e., representational theory of measurement. It is maintained here that this theory has its own merits but it is incomplete and too abstract, its main weakness being the scant attention reserved to the empirical side of measurement, i.e., to measurement systems and to the (...) ways in which the interactions of such systems with the entities under measurement provide a structure to an empirical domain. In particular it is claimed that (1) it is on the ground of the interaction with a measurement system that a partition can be induced on the domain of entities under measurement and that relations among such entities can be established, and that (2) it is the usage of measurement systems that guarantees a degree of objectivity and intersubjectivity to measurement results. As modeled in this paper, measurement systems link the abstract theory of measuring, as developed in representational terms, and the practice of measuring, as coded in standard documents such as the International Vocabulary of Metrology. (shrink)

In the present article two possible meanings of the term mathematical structure are discussed: a formal and a nonformal one. It is claimed that contemporary mathematics is structural only in the nonformal sense of the term. Bourbaki's definition of structure is presented as one among several attempts to elucidate the meaning of that nonformal idea by developing a formal theory which allegedly accounts for it. It is shown that Bourbaki's concept of structure was, from a mathematical point of view, a (...) superfluous undertaking. This is done by analyzing the role played by the concept, in the first place, within Bourbaki's own mathematical output. Likewise, the interaction between Bourbaki's work and the first stages of category theory is analyzed, on the basis of both published texts and personal documents. (shrink)

Craig's interpolation theorem fails for the propositional logics E of entailment, R of relevant implication and T of ticket entailment, as well as in a large class of related logics. This result is proved by a geometrical construction, using the fact that a non-Arguesian projective plane cannot be imbedded in a three-dimensional projective space. The same construction shows failure of the amalgamation property in many varieties of distributive lattice-ordered monoids.

This paper is closely related to investigations of abstract properties of basic logical notions expressible in terms of closure spaces as they were begun by A. Tarski (see [6]). We shall prove many properties of -conjunctive closure spaces (X is -conjunctive provided that for every two elements of X their conjunction in X exists). For example we prove the following theorems:1. For every closed and proper subset of an -conjunctive closure space its interior is empty (i.e. it is a boundary (...) set). 2. If X is an -conjunctive closure space which satisfies the -compactness theorem and [X] is a meet-distributive semilattice (see [3]), then the lattice of all closed subsets in X is a Heyting lattice. 3. A closure space is linear iff it is an -conjunctive and topological space. 4. Every continuous function preserves all conjunctions. (shrink)

Logical matrices for orthomodular logic are introduced. The underlying algebraic structures are orthomodular lattices, where the conditional connective is the Sasaki arrow. An axiomatic calculusOMC is proposed for the orthomodular-valid formulas.OMC is based on two primitive connectives — the conditional, and the falsity constant. Of the five axiom schemata and two rules, only one pertains to the falsity constant. Soundness is routine. Completeness is demonstrated using standard algebraic techniques. The Lindenbaum-Tarski algebra ofOMC is constructed, and it is shown to be (...) an orthomodular lattice whose unit element is the equivalence class of theses ofOMC. (shrink)

The infinite-valued logic of ukasiewicz was originally defined by means of an infinite-valued matrix. ukasiewicz took special forms of negation and implication as basic connectives and proposed an axiom system that he conjectured would be sufficient to derive the valid formulas of the logic; this was eventually verified by M. Wajsberg. The algebraic counterparts of this logic have become know as Wajsberg algebras. In this paper we show that a Wajsberg algebra is complete and atomic (as a lattice) if and (...) only if it is a direct product of finite Wajsberg chains. The classical characterization of complete and atomic Boolean algebras as fields of sets is a particular case of this result. (shrink)

In this paper we prove the equivalence between the Gentzen system G LJ*\c , obtained by deleting the contraction rule from the sequent calculus LJ* (which is a redundant version of LJ), the deductive system IPC*\c and the equational system associated with the variety RL of residuated lattices. This means that the variety RL is the equivalent algebraic semantics for both systems G LJ*\c in the sense of [18] and [4], respectively. The equivalence between G LJ*\c and IPC*\c is a (...) strengthening of a result obtained by H. Ono and Y. Komori [14, Corollary 2.8.1] and the equivalence between G LJ*\c and the equational system associated with the variety RL of residuated lattices is a strengthening of a result obtained by P.M. Idziak [13, Theorem 1].An axiomatization of the restriction of IPC*\c to the formulas whose main connective is the implication connective is obtained by using an interpretation of G LJ*\c in IPC*\c. (shrink)

Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $$p\wedge \Diamond \lnot p$$ (‘p, but it might be that not p’) appears to be a contradiction, $$\Diamond \lnot p$$ does not entail $$\lnot p$$, which would follow in classical logic. Likewise, the classical laws of distributivity and disjunctive syllogism fail for epistemic modals. Existing attempts to account for these facts generally either under- or over-correct. (...) Some theories predict that $$ p\wedge \Diamond \lnot p$$, a so-called epistemic contradiction, is a contradiction only in an etiolated sense, under a notion of entailment that does not always allow us to replace $$p\wedge \Diamond \lnot p$$ with a contradiction; these theories underpredict the infelicity of embedded epistemic contradictions. Other theories savage classical logic, eliminating not just rules that intuitively fail, like distributivity and disjunctive syllogism, but also rules like non-contradiction, excluded middle, De Morgan’s laws, and disjunction introduction, which intuitively remain valid for epistemic modals. In this paper, we aim for a middle ground, developing a semantics and logic for epistemic modals that makes epistemic contradictions genuine contradictions and that invalidates distributivity and disjunctive syllogism but that otherwise preserves classical laws that intuitively remain valid. We start with an algebraic semantics, based on ortholattices instead of Boolean algebras, and then propose a possibility semantics, based on partial possibilities related by compatibility. Both semantics yield the same consequence relation, which we axiomatize. We then show how to lift an arbitrary possible worlds model for a non-modal language to a possibility model for a language with epistemic modals. The goal throughout is to retain what is desirable about classical logic while accounting for the non-classicality of epistemic vocabulary. (shrink)

The purpose of this paper is to show that the mathematics of quantum mechanics is the mathematics of set partitions linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite to more definite (...) states is the partition join operation at the set level that prefigures at the quantum level projective measurement as well as the formation of maximally-definite state descriptions by Dirac’s Complete Sets of Commuting Operators. This development is measured quantitatively by logical entropy at the set level and by quantum logical entropy at the quantum level. This follow-the-math approach supports the Literal Interpretation of QM—as advocated by Abner Shimony among others which sees a reality of objective indefiniteness that is quite different from the common sense and classical view of reality as being “definite all the way down”. (shrink)

In order to provide a unified framework for studying non-commutative algebraic logic, Rump and Yang used three axioms to define quantum B-algebras, which can be seen as implicational subreducts of quantales. Based on the work of Rump and Yang, in this paper we shall continue to investigate the properties of three axioms in quantum B-algebras. First, using two axioms we introduce the concept of generalized quantum B-algebras and prove that the opposite of the category GqBAlg of generalized quantum B-algebras is (...) equivalent to the category LogPQ of logical pre-quantales, but we can not prove that pre-quantales can be used as the injective objects in GqBAlg. Next, we use one axiom to propose the concept of C-algebras and show that a C-algebra is a group if and only if each of its elements is dualizing. Further, by dualizing elements of a C-algebra X, we can define different binary operations on X such that X is a moniod. Finally, we by the Zig–Zag relation discuss some properties of quantum B-algebras. (shrink)

Uncertainty natural language processing has always been a research focus in the artificial intelligence field. In this paper, we continue to study the linguistic truth-valued concept lattice and apply it to the disease intelligent diagnosis by building an intelligent model to directly handle natural language. The theoretical bases of this model are the classical concept lattice and the lattice implication algebra with natural language. The model includes the case library formed by patients, attributes matching, and the matching degree calculation about (...) the new patient. According to the characteristics of the patients, the disease attributes are firstly divided into intrinsic invariant attributes and extrinsic variable attributes. The calculation algorithm of the linguistic truth-valued formal concepts and the constructing algorithm of the linguistic truth-valued concept lattice based on the extrinsic attributes are proposed. And the disease bases of the different treatments for different patients with the same disease are established. Secondly, the matching algorithms of intrinsic attributes and extrinsic attributes are given, and all the linguistic truth-valued formal concepts that match the new patient’s extrinsic attributes are found. Lastly, by comparing the similarity between the new patients and the matching formal concepts, we calculate the best treatment options to realize the intelligent diagnosis of the disease. (shrink)

Strong Nash equilibrium and coalition-proof Nash equilibrium rely on the idea that players are allowed to form coalitions and make joint deviations. Both of these notions consider cases in which any coalition can be formed. Accordingly, there may arise “conflicts of interest” that prevent a player from choosing an action that simultaneously meets the requirements of two coalitions to which he or she belongs. Here, we address this observation by studying an organizational framework such that the coalitional structure is motivated (...) by real-life examples where players cannot form some coalitions and formulated in such a way that no conflicts of interest remain. We define an organization as an ordered collection of partitions of the player set such that any partition is coarser than the partitions that precede it. For any given organization, we introduce the notion of organizational Nash equilibrium. We analyze the existence of equilibrium in a subclass of games with strategic complementarities and illustrate how the proposed notion refines the set of Nash equilibria in some examples of normal form games. (shrink)

Structuralism has recently moved center stage in philosophy of mathematics. One of the issues discussed is the underlying logic of mathematical structuralism. In this paper, I want to look at the dual question, namely the underlying structures of logic. Indeed, from a mathematical structuralist standpoint, it makes perfect sense to try to identify the abstract structures underlying logic. We claim that one answer to this question is provided by categorical logic. In fact, we claim that the latter can be seen—and (...) probably should be seen—as being a structuralist approach to logic and it is from this angle that categorical logic is best understood. (shrink)

Particle theories intend to describe the fundamental constituents from which all matter is constructed and the interactions among them. These constituents include atoms and molecules as well as their subatomic constituents, nuclei and their component parts including elementary particles. We consider an alternative to the usual particle theories, but dealing with the same phenomena. We call these theories ‘QT’s’. This is an attempt to provide a formal description of the essential features of elementary particle theories within the framework of metatheoretical (...) structuralism. (shrink)

Just started a new book. The aim is to establish a science of knowledge in the same way that we have a science of physics or a science of materials. This might appear as an overly ambitious, possibly arrogant, objective, but bear with me. On the day I am beginning to write it–June 7th, 2020–, I think I am in possession of a few things that will help me to achieve this objective. Again, bear with me. My aim is well (...) reflected in the title I chose (just now) for this book: Knowledge & Logic: Towards a science of knowledge. Its most important feature is that I shall take logic to be to knowledge science as calculus is to physics or to materials science. I do not intend to reclaim knowledge from the bosom of philosophy, in which, known as epistemology its erudite discussion has hardly progressed since Plato first defined it as true belief with logos. With only a few adjustments, it will actually provide me with the right, science-bound start. More recently, knowledge has been reclaimed by the field of BA, a reclaim that has opened the box of Pandora: Among the evils, and perhaps at the head of the list, is an overly lay, essentially naive, notion of knowledge. But the very idea that one can have something like “knowledge (management) software” puts us on the right track. (shrink)

This book presents an English translation of a classic Russian text on duality theory for Heyting algebras. Written by Georgian mathematician Leo Esakia, the text proved popular among Russian-speaking logicians. This translation helps make the ideas accessible to a wider audience and pays tribute to an influential mind in mathematical logic. The book discusses the theory of Heyting algebras and closure algebras, as well as the corresponding intuitionistic and modal logics. The author introduces the key notion of a hybrid that (...) “crossbreeds” topology and order, resulting in the structures now known as Esakia spaces. The main theorems include a duality between the categories of closure algebras and of hybrids, and a duality between the categories of Heyting algebras and of so-called strict hybrids. Esakia’s book was originally published in 1985. It was the first of a planned two-volume monograph on Heyting algebras. But after the collapse of the Soviet Union, the publishing house closed and the project died with it. Fortunately, this important work now lives on in this accessible translation. The Appendix of the book discusses the planned contents of the lost second volume. (shrink)

In this paper I focus on a recently discussed phenomenon illustrated by sentences containing predicates of taste: the phenomenon of " perspectival plurality " , whereby sentences containing two or more predicates of taste have readings according to which each predicate pertains to a different perspective. This phenomenon has been shown to be problematic for (at least certain versions of) relativism. My main aim is to further the discussion by showing that the phenomenon extends to other perspectival expressions than predicates (...) of taste and by proposing a general solution to the problem raised by it on behalf of the relativist. The core claim of the solution (" multiple indexing ") is that utterances of sentences containing perspectival expressions should be evaluated with respect to (possibly infinite) sequences of perspective parameters. (shrink)

ABSTRACTCorrespondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility relation. If the underlying set of the frame is split into two components,, and, then frames are at the same time the basis for models of non-distributive lattice logic and of two-sorted, residuated modal logic. This suggests that (...) a reduction of the first to the latter may be possible, encoding Positive Lattice Logic as a fragment of Two-Sorted, Residuated Modal Logic. The reduction is analogous to the well-known Gödel-McKinsey-Tarski translation of Intuitionistic Logic into the S4 system of normal modal logic. In this article, we carry out this reduction in detail and we derive some properties of PLL from corresponding properties of First-Order Logic. The reduction we present is extendible to the case of lattices with operators, making use of recent results by this author on the relational representation of normal lattice expansions. (shrink)

A geometric lattice is the lattice of closed subsets of a closure operator on a set which is zero-closure, algebraic, atomistic and which has the so-called exchange property. There are many profound results about this type of lattices, the most recent one of which, due to Czédli and Schimdt, says that a lattice L of finite length is semimodular if and only if L has a cover-preserving embedding into a geometric lattice G of the same length. The goal of our (...) paper is to offer the following result: a lattice of finite length is semimodular if and only if every cell in L is a 4-element Boolean lattice and the 7-element non-distributive atomistic lattice having 3 atoms is not a cover-preserving sublattice of L. (shrink)

The solution of the problem of the future random events truth is considered in Vasil’ev’s logic. N. A. Vasil’ev graded the logic according to two levels—the level of facts, i.e. time fixed events, and the level of notions or rules, governing these facts. The mathematical construction previously suggested for imaginary Vasil’ev’s logic, extends to the early variant of his logic—a logic of notions. In the paper, we investigate the meaning of problematic and uncertain assertions introduced by Vasil’ev. As a result, (...) we developed a model of Vasil’ev’s logic of facts that resolves also the truth problem of future random events. The imaginary logic has also been extended to the level of notions, and the law of the excluded eighth is gotten in it. The correspondence between Vasil’ev’s terms “some” and “all” and modern quantifiers is discussed. (shrink)

A categorical, higher dimensional algebra and generalized topos framework for Łukasiewicz–Moisil Algebraic–Logic models of non-linear dynamics in complex functional genomes and cell interactomes is proposed. Łukasiewicz–Moisil Algebraic–Logic models of neural, genetic and neoplastic cell networks, as well as signaling pathways in cells are formulated in terms of non-linear dynamic systems with n-state components that allow for the generalization of previous logical models of both genetic activities and neural networks. An algebraic formulation of variable ‘next-state functions’ is extended to a Łukasiewicz–Moisil (...) Topos with an n-valued Łukasiewicz–Moisil Algebraic Logic subobject classifier description that represents non-random and non-linear network activities as well as their transformations in developmental processes and carcinogenesis. The unification of the theories of organismic sets, molecular sets and Robert Rosen’s (M,R)-systems is also considered here in terms of natural transformations of organismal structures which generate higher dimensional algebras based on consistent axioms, thus avoiding well known logical paradoxes occurring with sets. Quantum bionetworks, such as quantum neural nets and quantum genetic networks, are also discussed and their underlying, non-commutative quantum logics are considered in the context of an emerging Quantum Relational Biology. (shrink)

We characterize the existence of semicontinuous weak utilities in a general framework, where the axioms of transitivity and acyclicity are relaxed to that of consistency in the sense of Suzumura (Economica 43:381–390, 1976). This kind of representations allow us to transfer the problem of the existence of the ${{\mathcal{G}}{\mathcal{O}}{\mathcal{C}}{\mathcal{H}}{\mathcal{A}}}$ set of a binary relation to the easier problem of getting maxima of a real function. Finally, we show that the maxima of these representations correspond to the different levels of satiation (...) that each of individual has (an individual reaches his or her level of satiation when an increase of consuming an alternative product/service brings no increase in utility). (shrink)

A characterization of a property of binary relations is of finite type if it is stated in terms of ordered T-tuples of alternatives for some positive integer T. The concept was introduced informally by Knoblauch (2005). We give a clear, complete definition below. We prove that a characterization of finite type can be used to determine in polynomial time whether a binary relation over a finite set has the property characterized. We also prove a simple but useful nonexistence theorem and (...) apply it to three examples. (shrink)

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the Bernays postulates for quantifiers and the comprehension schemata of ZF and other set theories. We prove that it is consistent in any finite Boolean subset lattice. We investigate the antinomies of Russell, Cantor, Burali-Forti, and others, and discuss the relationship of the system to other set-theoretic (...) systems ZF, NBG, and NF. We discuss two methods of axiomatizing higher order quantification and abstraction, and then very briefly discuss the application of one of these methods to areas of mathematics outside of logic. (shrink)

This heuristic article introduces a generalization of the idea of drawing colored balls from an urn so as to allow mutually incompatible experiments to be represented, thereby providing a device for thinking about quantum logic and other non-classical statistical situations in a concrete way. Such models have proven valuable in generating examples and counterexamples and in making abstract definitions in quantum logic seem more intuitive.

The lack of double negation and de Morgan properties makes fuzzy logic unsymmetrical. This is the reason why fuzzy versions of notions like closure operator or Galois connection deserve attention for both antiotone and isotone cases, these two cases not being dual. This paper offers them attention, comming to the following conclusions: – some kind of hardly describable ‘‘local preduality’’ still makes possible important parallel results; – interesting new concepts besides antitone and isotone ones (like, for instance, conjugated pair), that (...) were classically reducible to the first, gain independency in fuzzy setting. (shrink)

Models for the Lambek calculus of syntactic categories surveyed here are based on frames that are in principle of the same type as Kripke frames for intuitionistic logic. These models are extracted from the literature on models for relevant logics, in particular the ternary relationed models introduced in the early seventies. The purpose of this brief survey is to locate some open completeness problems for variants of the Lambek calculus in the context of completeness results based on various types of (...) ternary relational models. (shrink)

The study of information based on the approach of Shannon was detached from problems of meaning. Also, it did not allow analysis of the structural characteristics of information, nor describe the way structures carry information. An outline of a different theory of information, including its semantics, was earlier proposed by the author. This theory was using closure spaces to model information. In the present paper, structures (called syllogistics) underlying syllogistic reasoning as well as ethnoscientific classifications are identified together with the (...) conditions for the lattice of closed subsets describing information to allow its existence. The structures can be used for logical analysis outside of language at the more general level of information, which in turn can be applied to the description of semantic relations in the context of information. (shrink)

David Lewis holds that a single possible world can provide more than one way things could be. But what are possible worlds good for if they come apart from ways things could be? We can make sense of this if we go in for a metaphysical understanding of what the world is. The world does not include everything that is the case—only the genuine facts. Understood this way, Lewis's “cheap haecceitism” amounts to a kind of metaphysical anti-haecceitism: it says there (...) aren't any genuine facts about individuals over and above their qualitative roles. (shrink)

We construct a Galois connection between closure and interior operators on a given set. All arguments are intuitionistically valid. Our construction is an intuitionistic version of the classical correspondence between closure and interior operators via complement.

A meadow is a commutative ring with an inverse operator satisfying 0⁻¹ = 0. We determine the initial algebra of the meadows of characteristic 0 and prove a normal form theorem for it. As an immediate consequence we obtain the decidability of the closed term problem for meadows and the computability of their initial object.

By quoting extensively from unpublished letters written by John von Neumann to Garret Birkhoff during the preparatory phase (in 1935) of their ground-breaking 1936 paper that established quantum logic, the main steps in the thought process leading to the 1936 Birkhoff–von Neumann paper are reconstructed. The reconstruction makes it clear why Birkhoff and von Neumann rejected the notion of quantum logic as the projection lattice of an infinite dimensional complex Hilbert space and why they postulated in their 1936 paper that (...) the quantum propositional system should be isomorphic to an abstract projective geometry. Looking at the paper now I see, that I forgot to say this, which should be said somewhere in the first §: That while common logics did apply to quantum mechanics, if the notion of simultaneous measurability is introduced as an auxiliary notion, we wished to construct a logical system, which applies directly to quantum mechanics – without any extraneous secondary notions like simultaneous measurability. And in order to have such a consequent, one-piece system of logics, we must change the classical class calculus of logics. (J. von Neumann to G. Birkhoff, November 21, 1935). (shrink)

Recommended: Edo Airoldi, David M. Blei, Stephen E. Fienberg, Anna Goldenberg, Eric P. Xing and Alice X. Zheng (eds.), Statistical Network Analysis: Models, Issues, and New Directions [Disclaimer: contains one of my papers .] Aaron Clauset and Cristopher Moore, "Accuracy and Scaling Phenomena in Internet Mapping", cond-mat/0410059 = Physical Review Letters 94 (2005).