We prove completeness of the propositional modal logic S 4 for the measure algebra based on the Lebesgue-measurable subsets of the unit interval, [0, 1]. In recent talks, Dana Scott introduced a new measure-based semantics for the standard propositional modal language with Boolean connectives and necessity and possibility operators, and . Propositional modal formulae are assigned to Lebesgue-measurable subsets of the real interval [0, 1], modulo sets of measure zero. Equivalence classes of Lebesgue-measurable subsets form a measure algebra, , and (...) we add to this a non-trivial interior operator constructed from the frame of ‘open’ elements—elements in with an open representative. We prove completeness of the modal logic S 4 for the algebra . A corollary to the main result is that non-theorems of S 4 can be falsified at each point in a subset of the real interval [0, 1] of measure arbitrarily close to 1. A second corollary is that Intuitionistic propositional logic (IPC) is complete for the frame of open elements in. (shrink)

We give a general method for producing various effective Null and Positivstellensätze, and getting new Positivstellensätze in algebraically closed valued fields and ordered groups. These various effective Nullstellensätze produce algebraic identities certifying that some geometric conditions cannot be simultaneously satisfied. We produce also constructive versions of abstract classical results of algebra based on Zorn's lemma in several cases where such constructive version did not exist. For example, the fact that a real field can be totally ordered, or the fact that (...) a field can be embedded in an algebraically closed field. Our results are based on the concepts we develop of dynamical proofs and simultaneous collapse. (shrink)

Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional dynamic (...) logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject. (shrink)

This article explores the complementary strengths and weaknesses of grounded and abstract representations in the domain of early algebra. Abstract representations, such as algebraic symbols, are concise and easy to manipulate but are distanced from any physical referents. Grounded representations, such as verbal descriptions of situations, are more concrete and familiar, and they are more similar to physical objects and everyday experience. The complementary computational characteristics of grounded and abstract representations lead to trade‐offs in problem‐solving performance. In prior research with (...) high school students solving relatively simple problems, Koedinger and Nathan (2004) demonstrated performance benefits of grounded representations over abstract representations—students were better at solving simple story problems than the analogous equations. This article extends this prior work to examine both simple and more complex problems in two samples of college students. On complex problems with two references to the unknown, a “symbolic advantage” emerged, such that students were better at solving equations than analogous story problems. Furthermore, the previously observed “verbal advantage” on simple problems was replicated. We thus provide empirical support for a trade‐off between grounded, verbal representations, which show advantages on simpler problems, and abstract, symbolic representations, which show advantages on more complex problems. (shrink)

In the second chapter of his book Kant and the Exact Sciences Michael Friedman deals with two different interpretations of the relation or the difference between algebra and arithmetic in Kant's thought. According to the first interpretation algebra can be described as general arithmetic because it generalizes over all numbers by the use of variables, whereas arithmetic only deals with particular numbers. The alternative suggestion is that algebra is more general than arithmetic because it considers a more general class of (...) magnitudes. This means that arithmetic is concerned only with rational magnitudes, whereas algebra is also concerned with irrational magnitudes. In this article, I will discuss which of the two aforementioned approaches is to be considered the most plausible interpretation of Kant's theory of algebra and arithmetic. According to Friedman, the first interpretation cannot be reconciled with certain statements made by Kant on various occasions. The second interpretation is developed by Friedman himself. It is meant to be an attempt to avoid such inconsistencies. By a detailed analysis of the texts Friedman himself cites I shall examine the soundness of his arguments against the first interpretation and the compatibility of his own interpretation of the difference between algebra and arithmetic with the relevant passages in Kant's texts. It will turn out that the reasons that make Friedman reject the first interpretation are invalid as they are based on misunderstandings and that his own interpretation does not expound Kant's notions on that subject correctly, whereas the first interpretation is compatible with these passages. Thus, I conclude that the interpretation rejected by Friedman, unlike his own approach, is actually the more adequate interpretation of Kant. (shrink)

Important study focuses on the revival and assimilation of ancient Greek mathematics in the 13th–16th centuries, via Arabic science, and the 16th-century development of symbolic algebra. This brought about the crucial change in the concept of number that made possible modern science — in which the symbolic "form" of a mathematical statement is completely inseparable from its "content" of physical meaning. Includes a translation of Vieta's Introduction to the Analytical Art. 1968 edition. Bibliography.

We study the theory of a Hilbert space H as a module for a unital C*-algebra ${\mathcal{A}}$ from the point of view of continuous logic. We give an explicit axiomatization for this theory and describe the structure of all the representations which are elementary equivalent to it. Also, we show that this theory has quantifier elimination and we characterize the model companion of the incomplete theory of all non-degenerate representations of ${\mathcal{A}}$ . Finally, we show that there is an homeomorphism (...) between the space of types of norm less than 1 in this model companion, and the space of quasistates of the C*-algebra ${\mathcal{A}}$. (shrink)

We define a finite relation algebra and show that the network satisfaction problem is undecidable for this algebra.

We present a full completeness theorem for the multiplicative fragment of a variant of noncommutative linear logic, Yetter's cyclic linear logic (CyLL). The semantics is obtained by interpreting proofs as dinatural transformations on a category of topological vector spaces, these transformations being equivariant under certain actions of a noncocommutative Hopf algebra called the shuffie algebra. Multiplicative sequents are assigned a vector space of such dinaturals, and we show that this space has as a basis the denotations of cut-free proofs in (...) CyLL + MIX. This can be viewed as a fully faithful representation of a free *-autonomous category, canonically enriched over vector spaces. This paper is a natural extension of the authors' previous work, "Linear Lauchli Semantics", where a similar theorem is obtained for the commutative logic MLL + MIX. In that paper, we interpret proofs as dinaturals which are invariant under certain actions of the additive group of integers. Here we also present a simplification of that work by showing that the invariance criterion is actually a consequence of dinaturality. The passage from groups to Hopf algebras in this paper corresponds to the passage from commutative to noncommutative logic. However, in our noncommutative setting, one must still keep the invariance condition on dinaturals. (shrink)

It is shown that there is a subalgebra of the measure algebra forcing dominating reals. Also results are given about iterated forcing connected with random reals.

In this paper we prove that, for n > 1, the n-generated free algebra in any locally finite subvariety of HoRA can be written in a unique nontrivial way as Ł2 × A′, where A′ is a directly indecomposable algebra in . More precisely, we prove that the unique nontrivial pair of factor congruences of is given by the filters and , where the element is recursively defined from the term introduced by W. H. Cornish. As an additional result we (...) obtain a characterization of minimal irreducible filters of in terms of its coatoms. (shrink)

We give an example of a variety of Heyting algebras and of a splitting algebra in this variety that is not finitely presentable. Moreover, we show that the corresponding splitting pair cannot be defined by any finitely presentable algebra. Also, using the Gödel-McKinsey-Tarski translation and the Blok-Esakia theorem, we construct a variety of Grzegorczyk algebras with similar properties.

The main notion dealt with in this article is where A is a Boolean algebra. A partition of 1 is a family ofnonzero pairwise disjoint elements with sum 1. One of the main reasons for interest in this notion is from investigations about maximal almost disjoint families of subsets of sets X, especially X=ω. We begin the paper with a few results about this set-theoretical notion.Some of the main results of the paper are:• (1) If there is a maximal family (...) of size λ≥κ of pairwise almost disjoint subsets of κ each of size κ, then there is a maximal family of size λ of pairwise almost disjoint subsets of κ+ each of size κ.• (2) A characterization of the class of all cardinalities of partitions of 1 in a product in terms of such classes for the factors; and a similar characterization for weak products.• (3) A cardinal number characterization of sets of cardinals with a largest element which are for some BA the set of all cardinalities of partitions of 1 of that BA.• (4) A computation of the set of cardinalities of partitions of 1 in a free product of finite-cofinite algebras. (shrink)

In this essay I will defend three points, the first being that Descartes- unlike the aristotelian traditon- maintained that abstraction is not a operation in which the intellect builds the mathematical object resorting to sensible ob- jects. Secondly I will demonstrate that, according to cartesian philosophy, the faculty of understanding has the ability to instatiate- within the process of abstraction- mathematical symbols that represent the relation between quantities, whether magnitude or multitude.And finally I will advocate that the lack of onthological (...) commitment with sensible experience found in cartesian philosophy of mathematics allows for the creation of a mathematical language that regards the objects of geometry and arithmetics through a system of rules and notations, in other words, algebra. (shrink)

Deontic logic is devoted to the study of logical properties of normative predicates such as permission, obligation and prohibition. Since it is usual to apply these predicates to actions, many deontic logicians have proposed formalisms where actions and action combinators are present. Some standard action combinators are action conjunction, choice between actions and not doing a given action. These combinators resemble boolean operators, and therefore the theory of boolean algebra offers a well-known athematical framework to study the properties of the (...) classic deontic operators when applied to actions. In his seminal work, Segerberg uses constructions coming from boolean algebras to formalize the usual deontic notions. Segerberg’s work provided the initial step to understand logical properties of deontic operators when they are applied to actions. In the last years, other authors have proposed related logics. In this chapter we introduce Segerberg’s work, study related formalisms and investigate further challenges in this area. (shrink)

It has been said that pragmatism's "merely instrumental" truths fail to motivate radical change whereas absolute ideals make excellent guiding and driving forces for justice. However, in Radical Equations: Math Literacy and Civil Rights, Robert Moses speaks of the radical success of pragmatic principles, used in the Civil Rights Movement, that are continued today in the Algebra Project. This paper applies Dewey's claims about education and community to Moses's own arguments as a means of depicting the role that pragmatic ideals (...) play in achieving radical social change. (shrink)

In this paper, we introduce the notion of intuitionistic fuzzy PMS-subalgebras under homomorphism and Cartesian product and investigate several properties. We study the homomorphic image and inverse image of the intuitionistic fuzzy PMS-subalgebras of a PMS-algebra, which are also intuitionistic fuzzy PMS-subalgebras of a PMS-algebra, and find some other interesting results. Furthermore, we also prove that the Cartesian product of intuitionistic fuzzy PMS-subalgebras is again an intuitionistic fuzzy PMS-subalgebra and characterize it in terms of its level sets. Finally, we consider (...) the strongest intuitionistic fuzzy PMS-relations on an intuitionistic fuzzy set in a PMS-algebra and demonstrate that an intuitionistic fuzzy PMS-relation on an intuitionistic fuzzy set in a PMS-algebra is an intuitionistic fuzzy PMS-subalgebra if and only if the corresponding intuitionistic fuzzy set in a PMS-algebra is an intuitionistic fuzzy PMS-subalgebra of a PMS-algebra. (shrink)

In this article, the concepts of Nth Power Set of a Set, Super-Hyper-Oper-Operation, Super-Hyper-Axiom, SuperHyper-Algebra, and their corresponding Neutrosophic Super-Hyper-Oper-Operation, Neutrosophic Super-Hyper-Axiom and Neutrosophic Super-Hyper-Algebra are reviewed. In general, in any field of knowledge, really what are found are Super-HyperStructures (or more specifically Super-Hyper-Structures (m, n)).

Leibniz’s binary numeral system is generally studied for its arithmetical relevance, but the analysis of several unpublished manuscripts shows that from the very beginning Leibniz also envisaged a new form of algebra in the context of dyadics based on the idea that its letters can only express numbers that are either 1 or 0. In this paper, I shall present the most notable results of this binary algebra: the determination of the algorithm for the expansion of squares and the development (...) of the positional notation used to express any possible number. These achievements explain the priority of dyadics over any other numeral system in Leibniz’s mind and his impressive work on the classification of numbers which was facilitated by tools and notions which were only accessible to him at that time. (shrink)

Leibniz’s binary numeral system is generally studied for its arithmetical relevance, but the analysis of several unpublished manuscripts shows that from the very beginning Leibniz also envisaged a new form of algebra in the context of dyadics based on the idea that its letters can only express numbers that are either 1 or 0. In this paper, I shall present the most notable results of this binary algebra: the determination of the algorithm for the expansion of squares and the development (...) of the positional notation used to express any possible number. These achievements explain the priority of dyadics over any other numeral system in Leibniz’s mind and his impressive work on the classification of numbers which was facilitated by tools and notions which were only accessible to him at that time. (shrink)

Various representation results have been established for logics of belief revision, in terms of remainder sets, epistemic entrenchment, systems of spheres and so on. In this paper I present another representation for logics of belief revision, as an algebra of theories. I show that an algebra of theories, enriched with a set of rejection operations, provides a suitable algebraic framework to characterize the theory change operations of systems of belief revision. The theory change operations arise as power operations of the (...) conjunction and disjunction connectives of the underlying logic. (shrink)

A study of the making of George Peacock's highly influential, yet disturbingly split, 1830 account of algebra as an entanglement of two separate undertakings: arithmetical and symbolical or formal.

We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect information games and epistemic logic. We also identify some new open problems concerning logic and games.

In this note we shall show that if L is a balanced pseudocomplemented Ockham algebra then the set ${\fancyscript{I}_{k}(L)}$ of kernel ideals of L is a Heyting lattice that is isomorphic to the lattice of congruences on B(L) where ${B(L) = \{x^* | x \in L\}}$ . In particular, we show that ${\fancyscript{I}_{k}(L)}$ is boolean if and only if B(L) is finite, if and only if every kernel ideal of L is principal.

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)

Elementary particles are considered as local oscillators under the influence of zeropoint fields. Such oscillatory behavior of the particles leads to the deviations in their path of motion. The oscillations of the particle in general may be considered as complex rotations in complex vector space. The local particle harmonic oscillator is analyzed in the complex vector formalism considering the algebra of complex vectors. The particle spin is viewed as zeropoint angular momentum represented by a bivector. It has been shown that (...) the particle spin plays an important role in the kinematical intrinsic or local motion of the particle. From the complex vector formalism of harmonic oscillator, for the first time, a relation between mass $m$ and bivector spin $S$ has been derived in the form $\varvec{\sigma }_3 mc^2{\mathcal {J}}_{\pm } =\lambda \Omega _{\mathbf{s}} \cdot \mathrm{{S}} {\mathcal {J}}_{\pm }$ . Where, $\Omega _{s}$ is the angular velocity bivector of complex rotations, $c$ is the velocity of light. The unit vector $\varvec{\sigma }_3$ acts as an operator on the idempotents ${\mathcal {J}}_{+}$ and ${\mathcal {J}}_{-}$ to give the eigen values $\lambda =\pm 1.$ The constant $\lambda $ represents two fold nature of the equation corresponding to particle and antiparticle states. Further the above relation shows that the mass of the particle may be interpreted as a local spatial complex rotation in the rest frame. This gives an insight into the nature of fundamental particles. When a particle is observed from an arbitrary frame of reference, it has been shown that the spatial complex rotation dictates the relativistic particle motion. The mathematical structure of complex vectors in space and spacetime is developed. (shrink)

The purpose of this article is to analyse the mathematical practices leading to Rafael Bombelli’s L’algebra (1572). The context for the analysis is the Italian algebra practiced by abbacus masters and Renaissance mathematicians of the fourteenth to sixteenth centuries. We will focus here on the semiotic aspects of algebraic practices and on the organisation of knowledge. Our purpose is to show how symbols that stand for underdetermined meanings combine with shifting principles of organisation to change the character of algebra.

We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect information games and epistemic logic. We also identify some new open problems concerning logic and games.

We try to find a possible origin of the holographic principle in the Lorentz-covariant Yang’s quantized space-time algebra (YSTA). YSTA, which is intrinsically equipped with short- and long-scale parameters, λ and R, gives a finite number of spatial degrees of freedom for any bounded spatial region, providing a basis for divergence-free quantum field theory. Furthermore, it gives a definite kinematical reduction of spatial degrees of freedom, compared with the ordinary lattice space. On account of the latter fact, we find a (...) certain kind of kinematical holographic relation in YSTA, which may be regarded as a primordial form of the holographic principle suggested so far in the framework of the present quantum theory that appears now in the contraction limit of YSTA, λ→0 and R→∞. (shrink)

Humans communicate with different modalities. We offer an account of multi-modal meaning coordination, taking speech-gesture meaning coordination as a prototypical case. We argue that temporal synchrony (plus prosody) does not determine how to coordinate speech meaning and gesture meaning. Challenging cases are asynchrony and broadcasting cases, which are illustrated with empirical data. We propose that a process algebra account satisfies the desiderata. It models gesture and speech as independent but concurrent processes that can communicate flexibly with each other and exchange (...) the same information more than once. The account utilizes the ψ-calculus, allowing for agents, input-output-channels, concurrent processes, and data transport of typed λ-terms. A multi-modal meaning is produced integrating speech meaning and gesture meaning into one semantic package. Two cases of meaning coordination are handled in some detail: the asynchrony between gesture and speech, and the broadcasting of gesture meaning across several dialogue contributions. This account can be generalized to other cases of multi-modal meaning. (shrink)

In a recent paper, we have shown that the class of Boolean contact algebras (BCAs) has the hereditary property, the joint embedding property and the amalgamation property. By Fraïssé’s theorem, this shows that there is a unique countable homogeneous BCA. This paper investigates this algebra and the relation algebra generated by its contact relation. We first show that the algebra can be partitioned into four sets {0}, {1}, K, and L, which are the only orbits of the group of base (...) automorphisms of the algebra, and then show that the contact relation algebra of this algebra is finite, which is the first non-trivial extensional BCA we know which has this property. (shrink)