In this paper, I define and study an abstract algebraic structure, the dimensive algebra, which embodies the most general features of the algebra of dimensional physical quantities. I prove some elementary results about dimensive algebras and suggest some directions for future work.

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, (...) Löwenheim and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

It is tough to relate visual perception or other achievements to physiological processing in the central nervous system. The diagrammatic, algebraic, and verbal pictures of how sights seem to Lehar do not advance understanding of how we manage to see what is in the world. There are well-known conceptual reasons why no such purely introspective approach can be productive.

Relevance logic has become ontologically fertile. No longer is the idea of relevance restricted in its application to purely logical relations among propositions, for as Dunn has shown in his (1987), it is possible to extend the idea in such a way that we can distinguish also between relevant and irrelevant predications, as for example between “Reagan is tall” and “Reagan is such that Socrates is wise”. Dunn shows that we can exploit certain special properties of identity within the context (...) of standard relevance logic in a way which allows us to discriminate further between relevant and irrelevant properties, as also between relevant and irrelevant relations. The idea yields a family of ontologically interesting results concerning the different ways in which attributes and objects may hang together. Because of certain notorious peculiarities of relevance logic, however,1 Dunn’s idea breaks down where the attempt is made to have it bear fruit in application to relations among entities which are of homogeneous type. (shrink)

This book extends the concept of linguistic coordinate geometry using linguistic planes or semi-linguistic planes. In the case of coordinate planes, we are always guaranteed of the distance between any two points in that plane. However, in the case of linguistic and semi-linguistic planes, we can not always determine the linguistic distance between any two points. This is the first limitation of linguistic planes and semi-linguistic planes.

In this book, authors, for the first time, introduce the new notion of special subset linguistic topological spaces using linguistic square matrices. This book is organized into three chapters. Chapter One supplies the reader with the concept of ling set, ling variable, ling continuum, etc. Specific basic linguistic algebraic structures, like linguistic semigroup linguistic monoid, are introduced. Also, algebraic structures to linguistic square matrices are defined and described with examples. For the first time, non-commutative linguistic topological spaces are introduced. The (...) notion of a linguistic special subset of doubly non-commutative topological spaces of linguistic topological spaces is introduced in this book. (shrink)

The systematic study of supermatrices and super linear algebra has been carried out in 2008. These new algebraic structures find their applications in fuzzy models, Leontief economic models and data-storage in computers.

The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work aims to fill this gap by providing a comprehensive logico-algebraic analysis of Lewis's logics. We begin by introducing novel finite axiomatizations for varying strengths of Lewis's logics, distinguishing between global and local consequence relations on Lewisian sphere models. We then demonstrate that the global consequence relation is strongly algebraizable in (...) terms of a specific class of Boolean algebras with a binary operator representing the counterfactual implication; in contrast, we show that the local consequence relation is generally not algebraizable, although it can be characterized as the degree-preserving logic over the same algebraic models. Further, we delve into the algebraic semantics of Lewis's logics, developing two dual equivalences with respect to particular topological spaces. In more details, we show a duality with respect to the topological version of Lewis's sphere models, and also with respect to Stone spaces with a selection function; using the latter, we demonstrate the strong completeness of Lewis's logics with respect to sphere models. Finally, we draw some considerations concerning the limit assumption over sphere models. (shrink)

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all the axioms of (...) ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

Katie Steele and H. Orri Stefánsson argue that, to reflect an agent’s limited awareness, the algebra of propositions on which that agent’s credences are defined should be relativised to their awareness state. I argue that this produces insurmountable difficulties. But the project of relativising the agent’s algebra to reflect their partial perspective need not be abandoned: the algebra can be relativised, not to the agent’s awareness state, but to what we might call their subjective modality.

We introduce Pura Vida Neutrosophic Algebra, an algebraic structure consisting of neutrosophic numbers equipped with two binary operations namely addition and multiplication. The addition can be calculated sometimes with the function min and other times with the max function. The multiplication operation is the usual sum between numbers. Pura Vida Neutrosophic Algebra is an extension of both Tropical Algebra (also known as Min-Plus, or Min-Algebra) and Max-Plus Algebra (also known as Max-algebra). Tropical and Max-Plus (...) algebras are algebraic structures included in semirings and their operations can be used in matrices and vectors. Pura Vida Neutrosophic Algebra is included in Neutrosophic semirings and can be used in Neutrosophic matrices and vectors. (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express meta-logical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the Logics of Formal Inconsistency (LFIs) and by the Logics of Formal Undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the (...) validity of the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core– in the case studied here, this common core is classical positive propositional logic (CPL + ). The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of logics of formal inconsistency and undeterminedness (LFIUs), namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion at once. The last sections offer an algebraic account for such logics by adapting the swap-structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite non-deterministic matrices. (shrink)

Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator (...) ``in the limit'' within the ultrafilter of sentences that are true in the standard model. In previous work the author established the first case of this optimistic conjecture; roughly, every recursive monotone function is either as weak as the identity operator in the limit or as strong as $\mathsf{Con}_T$ in the limit. Yet in this note we prove that this optimistic conjecture fails already at the next step; there are recursive monotone functions that are neither as weak as $\mathsf{Con}_T$ in the limit nor as strong as $\mathsf{Con}_T^2$ in the limit. In fact, for every $\alpha$, we produce a function that is cofinally equivalent to $\mathsf{Con}^\alpha_T$ yet cofinally equivalent to $\mathsf{Con}_T$. (shrink)

The purpose of this study is to compile a selection of the various formalisms found in conversation theory to introduce readers to Pask's discursive algebra. In this way, the text demonstrates how concept sharing and concept formation by means of the interaction of two participants may be formalized. The approach taken in this study is to examine the formal notation system used by Pask and demonstrate how such formalisms may be used to represent concept sharing and concept formation through (...) conversation. The compilation of the discursive algebra using the framework provided by conversation theory could potentially be used as an auxiliary framework to study conversational interactions in multi-agent systems theory. (shrink)

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by the so-called classical (...) categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

Smarandache in 2019 has generalized the algebraic structures to NeutroAlgebraic structures and AntiAlgebraic structures. In this paper, authors, for the first time, define the NeutroAlgebra of neutrosophic triplets group under usual+ and x, built using {Zn, x}, n a composite number, 5 < n < oo, which are not partial algebras. As idempotents in Zn alone are neutrals that contribute to neutrosophic triplets groups, we analyze them and build NeutroAlgebra of idempotents under usual + and x, which are not partial (...) algebras. We prove in this paper the existence theorem for NeutroAlgebra of neutrosophic triplet groups. This proves the neutrals assocaited with neutrosophic triplet groups in { Zn, X} under product is a NeutroAlgebra of triplets. We also prove the non-existence theorem of NeutroAlgebra for neutrosophic triplets in case of Zn when n = 2p, 3p and 4p (for some primes p). Several open problems are proposed. Further, the NeutroAlgebras of extended neutrosophic triplet groups have been obtained. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.

Here algebraic Routley-Meyer semantics is addressed for two fuzzy versions of the logic of relevant implication R. To this end, two versions R t and R T of R and their fuzzy extensions FRt and FRT , respectively, are first discussed together with their algebraic semantics. Next algebraic Routley-Meyer semantics for these two fuzzy extensions is introduced. Finally, it is verified that these logics are sound and complete over the semantics.

The paper proposes a new formal approach to vagueness and vague sets taking inspirations from Pawlak’s rough set theory. Following a brief introduction to the problem of vagueness, an approach to conceptualization and representation of vague knowledge is presented from a number of different perspectives: those of logic, set theory, algebra, and computer science. The central notion of the vague set, in relation to the rough set, is defined as a family of sets approximated by the so called lower (...) and upper limits. The family is simultaneously considered as a family of all denotations of sharp terms representing a suitable vague term, from the agent’s point of view. Some algebraic operations on vague sets and their properties are defined. Some important conditions concerning the membership relation for vague sets, in connection to Blizard’s multisets and Zadeh’s fuzzy sets, are established as well. A classical outlook on a logic of vague sentences (vague logic) based on vague sets is also discussed. (shrink)

This article introduces the mathematical models of the thinking laws in the internal structure of consciousness, the spatial and temporal features of the thinking laws, and the phenomenon of resonance as a general feature of the cognitive process. The article will focus on the logical order and space-time existence of the thinking laws, by interrelating such mathematical concepts as Boolessche Algebra, Set theory, Crowd round of Abel, and ordinal number. Finally, the article discusses how thinking laws can a naturalized (...) theory of consciousness, and how they, together with established principles of consciousness, can play important roles in the process of cognition. (shrink)

The objective of this paper is to develop neutrosophic quadruple algebraic hyperstructures. Specifically, we develop neutrosophic quadruple semihypergroups, neutrosophic quadruple canonical hypergroups and neutrosophic quadruple hyperrings and we present elementary properties which characterize them.

In this article, we apply the notion of interval neutrosophic sets to ideal theory in BCK/BCI-algebras.

In this paper, we recall and study the new type of algebraic structures called Symbolic Plithogenic Algebraic Structures. Their operations are given under the Absorbance Law and the Prevalence Order.

We develop a structure theory for nilpotent symplectic alternating algebras. -/- We then give a classification of all nilpotent symplectic alternating algebras of dimension up to 10 over any field F. The study reveals a new subclasses of powerful groups that we call powerfully nilpotent groups and powerfully soluble groups.

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary quantifiers. (...) We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

This study provides an innovative approach to neutrosophic algebraic structures by introducing a new structure called Neutrosophic Soft Cubic T-ideal (NSCTID), which combines T-ideal (TID) and neutrosophic Soft Cubic Sets (NSCSs) within the framework of PS-Algebra. Within the already-existing neutrosophic cubic structures, the addition of soft sets with the characteristics of TID makes this structure more desirable. The theoretical development of the proposed structure includes the application of fundamental ideas as union, intersection, the Cartesian product, and homomorphism. We also (...) introduce the notions of NSCTID-translation and NSCTID-multiplication to further enhance the structure of NSCTID. By applying the idea of translation and multiplication, we offer improved algorithm for neutrosophic cubic sets to deal with different parameters that are satisying the TID’s distinctive characteristics. Through this thorough research, we offer an elementary understanding of NSCTID and its capabilities, providing the way to new algebraic structures. (shrink)

This volume presents state-of-the-art papers on new topics related to neutrosophic theories, such as neutrosophic algebraic structures, neutrosophic triplet algebraic structures, neutrosophic extended triplet algebraic structures, neutrosophic algebraic hyperstructures, neutrosophic triplet algebraic hyperstructures, neutrosophic n-ary algebraic structures, neutrosophic n-ary algebraic hyperstructures, refined neutrosophic algebraic structures, refined neutrosophic algebraic hyperstructures, quadruple neutrosophic algebraic structures, refined quadruple neutrosophic algebraic structures, neutrosophic image processing, neutrosophic image classification, neutrosophic computer vision, neutrosophic machine learning, neutrosophic artificial intelligence, neutrosophic data analytics, neutrosophic deep learning, and neutrosophic (...) symmetry, as well as their applications in the real world. (shrink)

The paper is the final, fifth part of a series of studies introducing the new conceptions of “Hilbert mathematics” and “ontomathematics”. The specific subject of the present investigation is the proper philosophical sense of both, including philosophy of mathematics and philosophy of physics not less than the traditional “first philosophy” (as far as ontomathematics is a conservative generalization of ontology as well as of Heidegger’s “fundamental ontology” though in a sense) and history of philosophy (deepening Heidegger’s destruction of it from (...) the pre-Socratics to the Pythagoreans). Husserl’s phenomenology and Heidegger’s derivative “fundamental ontology” as well as his later doctrine after the “turn” are the starting point of the research as established and well known approaches relative to the newly introduced conception of ontomathematics, even more so that Husserl himself started criticizing his “Philosophy of arithmetic” as too naturalistic and psychological turning to “Logical investigations” and the foundations of phenomenology. Heidegger’s “Aletheia” is also interpreted ontomathematically: as a relation of locality and nonlocality, respectively as a motion from nonlocality to locality if both are physically considered. Aristotle’s ontological revision of Plato’s doctrine is “destructed” further from the pre-Socratics' “Logos” or Heideger’s “Language” (after the “turn”) to the Pythagoreans “Numbers” or “Arithmetics” as an inherent and fundamental philosophical doctrine. Then, a leap to contemporary physics elucidates the essence of ontomathematics overcoming the Cartesian abyss inherited from Plato’s opposition of “ideas” versus “things”, and now unifying physics and mathematics, particularly allowing for the “creation from nothing” instead of the quasi-scientific myth of the “Big Bang”. Furthermore, ontomathematics needs another interpretation of arithmetic, propositional logic and set theory in the foundations of mathematics, where the latter two ones are both identified with Boolean algebra, and the former is considered to be a “half of Boolean algebra” in the exact meaning to be equated to it after doubling by a dual anti-isometric counterpart of Peano arithmetic. That unified algebraic realization of the foundations of mathematics is related to Hilbert mathematics in both “narrow and wide senses” where the latter is isomorphic to the qubit Hilbert space, thus underlying all the physical world by the newly introduced substance of quantum information being physically dimensionless and generalizing classical information measured in bits. The substance of information, whether classical or quantum, visualizes the way of the unification of physics and mathematics by merging their foundations in Hilbert arithmetic and Hilbert mathematics: thus how ontomathetics is a “first philosophy”. The relation of ontomathematics to the Socratic “human problematics”, furthermore being fundamental for Western philosophy in Modernity, is discussed. Ontomathematics implies its “substitution” by abstract information (or by “subjectless choice” relevant to it), thus “obliterating the human outline on the ocean beach sand” (by Michel Foucault’s metaphor). A reflection back from the viewpoint of mathematic to Western philosophy as the philosophy of locality ends the study. (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)

On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and a (...) natural extension of BLT is definitionally equivalent with ZF. (shrink)

In the recent years, problem-solving become a central topic that discussed by educators or researchers in mathematics education. it’s not only as the ability or as a method of teaching. but also, it is a little in reviewing about the components of the support to succeed in problem-solving, such as student's belief and attitude towards mathematics, algebraic thinking skills, resources and teaching materials. In this paper, examines the algebraic thinking skills as a foundation for problem-solving, and learning cycle as a (...) breath of continuous learning. In this paper, learning cycle to be used is a modified type of 5E based on beliefs. (shrink)

In the paper, various notions of the logical semiotic sense of linguistic expressions – namely, syntactic and semantic, intensional and extensional – are considered and formalised on the basis of a formal-logical conception of any language L characterised categorially in the spirit of certain Husserl's ideas of pure grammar, Leśniewski-Ajdukiewicz's theory of syntactic/semantic categories and, in accordance with Frege's ontological canons, Bocheński's and some of Suszko's ideas of language adequacy of expressions of L. The adequacy ensures their unambiguous syntactic and (...) semantic senses and mutual, syntactic and semantic correspondence guaranteed by the acceptance of a postulate of categorial compatibility of syntactic and semantic (extensional and intensional) categories of expressions of L. This postulate defines the unification of these three logical senses. There are three principles of compositionality which follow from this postulate: one syntactic and two semantic ones already known to Frege. They are treated as conditions of homomorphism of partial algebra of L into algebraic models of L: syntactic, intensional and extensional. In the paper, they are applied to some expressions with quantifiers. Language adequacy connected with the logical senses described in the logical conception of language L is, obviously, an idealisation. The syntactic and semantic unambiguity of its expressions is not, of course, a feature of natural languages, but every syntactically and semantically ambiguous expression of such languages may be treated as a schema representing all of its interpretations that are unambiguous expressions. (shrink)

Algebraic structures on linguistic sets associated with a linguistic variable are introduced. The linguistics with single closed binary operations are only semigroups and monoids. We describe the new notion of linguistic semirings, linguistic semifields, linguistic semivector spaces and linguistic semilinear algebras defined over linguistic semifields. We also define algebraic structures on linguistic subsets of a linguistic set associated with a linguistic variable. We define the notion of linguistic subset semigroups, linguistic subset monoids and their respective substructures. We also define as (...) in case of deals in classical semigroups, linguistic ideals in linguistic semigroups and linguistic monoids. This concept of linguistic ideals is extended to the case of linguistic subset semigroups and linguistic subset monoids. We also define linguistic substructures. (shrink)

In this book, the authors introduce the notion of Super linear algebra and super vector spaces using the definition of super matrices defined by Horst (1963). Many theorems on super linear algebra and its properties are proved. Some theorems are left as exercises for the reader. These new class of super linear algebras which can be thought of as a set of linear algebras, following a stipulated condition, will find applications in several fields using computers. The authors feel (...) that such a paradigm shift is essential in this computerized world. (shrink)

Among Dunn’s many important contributions to relevance logic was his work on the system RM (R-mingle). Although RM is an interesting system in its own right, it is widely considered to be too strong. In this chapter, I revisit a closely related system, RM0 (sometimes known as ‘constructive mingle’), which includes the mingle axiom while not degenerating in the way that RM itself does. My main interest will be in examining this logic from two related semantical perspectives. First, I give (...) a purely operational bisemilattice semantics for it by adapting previous work of Humberstone. Second, I examine a more conventional algebraic semantics for it and discuss how this relates to the operational semantics. A novel operational semantics for J (intuitionistic logic) as well as its conventional Heyting algebraic semantics emerge as special cases of the corresponding semantics for RM0. The results of this chapter suggest that RM0 is a more interesting logic than has been appreciated and that Humberstone’s operational semantic framework similarly deserves more attention than it has received. (shrink)

In this book authors for the first time introduce the notion of super interval matrices using special intervals. The advantage of using super interval matrices is that one can build only one vector space using m × n interval matrices, but in case of super interval matrices we can have several such spaces depending on the partition on the interval matrix.

Robert Batterman’s ontological insights (2002, 2004, 2005) are apt: Nature abhors singularities. “So should we,” responds the physicist. However, the epistemic assessments of Batterman concerning the matter prove to be less clear, for in the same vein he write that singularities play an essential role in certain classes of physical theories referring to certain types of critical phenomena. I devise a procedure (“methodological fundamentalism”) which exhibits how singularities, at least in principle, may be avoided within the same classes of formalisms (...) discussed by Batterman. I show that we need not accept some divergence between explanation and reduction (Batterman 2002), or between epistemological and ontological fundamentalism (Batterman 2004, 2005). Though I remain sympathetic to the ‘principle of charity’ (Frisch (2005)), which appears to favor a pluralist outlook, I nevertheless call into question some of the forms such pluralist implications take in Robert Batterman’s conclusions. It is difficult to reconcile some of the pluralist assessments that he and some of his contemporaries advocate with what appears to be a countervailing trend in a burgeoning research tradition known as Clifford (or geometric) algebra. In my critical chapters (2 and 3) I use some of the demonstrated formal unity of Clifford algebra to argue that Batterman (2002) equivocates a physical theory’s ontology with its purely mathematical content. Carefully distinguishing the two, and employing Clifford algebraic methods reveals a symmetry between reduction and explanation that Batterman overlooks. I refine this point by indicating that geometric algebraic methods are an active area of research in computational fluid dynamics, and applied in modeling the behavior of droplet-formation appear to instantiate a “methodologically fundamental” approach. I argue in my introductory and concluding chapters that the model of inter-theoretic reduction and explanation offered by Fritz Rohrlich (1988, 1994) provides the best framework for accommodating the burgeoning pluralism in philosophical studies of physics, with the presumed claims of formal unification demonstrated by physicists choices of mathematical formalisms such as Clifford algebra. I show how Batterman’s insights can be reconstructed in Rohrlich’s framework, preserving Batterman’s important philosophical work, minus what I consider are his incorrect conclusions. (shrink)

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means Hilbert-style calculi that are finite. On the negative side, we provide a syntactic condition on the equational presentation of a variety that entails failure of finite axiomatizability for the corresponding logic. An application of this result is that the logic of all distributive lattices with negation is not finitely axiomatizable; we likewise establish (...) that the order-preserving logic of the variety of all Ockham algebras is also not finitely axiomatizable. On the positive side, we show that an arbitrary subvariety of semi-De Morgan algebras is axiomatized by a finite number of equations if and only if the corresponding order-preserving logic is axiomatized by a finite Hilbert-style calculus. This equivalence also holds for every subvariety of a Berman variety of Ockham algebras. We obtain, as a corollary, a new proof that the implication-free fragment of intuitionistic logic is finitely axiomatizable, as well as a new corresponding Hilbert-style calculus. Our proofs are constructive in that they allow us to effectively convert an equational presentation of a variety of algebras into a Hilbert-style calculus for the corresponding order-preserving logic, and vice versa. We also consider the assertional logics associated to the above-mentioned varieties, showing in particular that the assertional logics of finitely axiomatizable subvarieties of semi-De Morgan algebras are finitely axiomatizable as well. (shrink)

This is the first book in a two-volume series. The present volume introduces the basics of the conceptual foundations of quantum physics. It appeared first as a series of video lectures on the online learning platform Udemy.]There is probably no science that is as confusing as quantum theory. There's so much misleading information on the subject that for most people it is very difficult to separate science facts from pseudoscience. The goal of this book is to make you able to (...) separate facts from fiction with a comprehensive introduction to the scientific principles of a complex topic in which meaning and interpretation never cease to puzzle and surprise. An A-Z guide which is neither too advanced nor oversimplified to the weirdness and paradoxes of quantum physics explained from the first principles to modern state-of-the-art experiments and which is complete with figures and graphs that illustrate the deeper meaning of the concepts you are unlikely to find elsewhere. A guide for the autodidact or philosopher of science who is looking for general knowledge about quantum physics at intermediate level furnishing the most rigorous account that an exposition can provide and which only occasionally, in few special chapters, resorts to a mathematical level that goes no further than that of high school. It will save you a ton of time that you would have spent searching elsewhere, trying to piece together a variety of information. The author tried to span an 'arch of knowledge' without giving in to the temptation of taking an excessively one-sided account of the subject. What is this strange thing called quantum physics? What is its impact on our understanding of the world? What is ‘reality’ according to quantum physics? This book addresses these and many other questions through a step-by-step journey. The central mystery of the double-slit experiment and the wave-particle duality, the fuzzy world of Heisenberg's uncertainty principle, the weird Schrödinger's cat paradox, the 'spooky action at a distance' of quantum entanglement, the EPR paradox and much more are explained, without neglecting such main contributors as Planck, Einstein, Bohr, Feynman and others who struggled themselves to come up with the mysterious quantum realm. We also take a look at the experiments conducted in recent decades, such as the surprising "which-way" and "quantum-erasure" experiments. Some considerations on why and how quantum physics suggests a worldview based on philosophical idealism conclude this first volume. This treatise goes, at times, into technical details that demand some effort and therefore requires some basics of high school math (calculus, algebra, trigonometry, elementary statistics). However, the final payoff will be invaluable: Your knowledge of, and grasp on, the subject of the conceptual foundations of quantum physics will be deep, wide, and outstanding. Additionally, because schools, colleges, and universities teach quantum physics using a dry, mostly technical approach which furnishes only superficial insight into its foundations, this manual is recommended for all those students, physicists or philosophers of science who would like to look beyond the mere formal aspect and delve deeper into the meaning and essence of quantum mechanics. The manual is a primer that the public deserves. (shrink)

We review a rough scheme of quantum mechanics using the Clifford algebra. Following the steps previously published in a paper by another author [31], we demonstrate that quantum interference arises in a Clifford algebraic formulation of quantum mechanics. In 1932 J. von Neumann showed that projection operators and, in particular, quantum density matrices can be interpreted as logical statements. In accord with a previously obtained result by V. F Orlov , in this paper we invert von Neumann’s result. Instead (...) of constructing logic from quantum mechanics , we construct quantum mechanics from an extended classical logic. It follows that the origins of the two most fundamental quantum phenomena , the indeterminism and the interference of probabilities, lie not in the traditional physics by itself but in the logical structure as realized here by the Clifford algebra. (shrink)

Bundles of C*-algebras can be used to represent limits of physical theories whose algebraic structure depends on the value of a parameter. The primary example is the ℏ→0 limit of the C*-algebras of physical quantities in quantum theories, represented in the framework of strict deformation quantization. In this paper, we understand such limiting procedures in terms of the extension of a bundle of C*-algebras to some limiting value of a parameter. We prove existence and uniqueness results for such extensions. Moreover, (...) we show that such extensions are functorial for the C*-product, dynamical automorphisms, and the Lie bracket (in the ℏ→0 case) on the fiber C*-algebras. (shrink)

Gauss’s quadratic reciprocity theorem is among the most important results in the history of number theory. It’s also among the most mysterious: since its discovery in the late 18th century, mathematicians have regarded reciprocity as a deeply surprising fact in need of explanation. Intriguingly, though, there’s little agreement on how the theorem is best explained. Two quite different kinds of proof are most often praised as explanatory: an elementary argument that gives the theorem an intuitive geometric interpretation, due to Gauss (...) and Eisenstein, and a sophisticated proof using algebraic number theory, due to Hilbert. Philosophers have yet to look carefully at such explanatory disagreements in mathematics. I do so here. According to the view I defend, there are two important explanatory virtues—depth and transparency—which different proofs (and other potential explanations) possess to different degrees. Although not mutually exclusive in principle, the packages of features associated with the two stand in some tension with one another, so that very deep explanations are rarely transparent, and vice versa. After developing the theory of depth and transparency and applying it to the case of quadratic reciprocity, I draw some morals about the nature of mathematical explanation. (shrink)

The book is a collection of papers and aims to unify the questions of syntax and semantics of language, which are included in logic, philosophy and ontology of language. The leading motif of the presented selection of works is the differentiation between linguistic tokens (material, concrete objects) and linguistic types (ideal, abstract objects) following two philosophical trends: nominalism (concretism) and Platonizing version of realism. The opening article under the title “The Dual Ontological Nature of Language Signs and the Problem of (...) Their Mutual Relations” provides a broad introduction into the problem area connected with this differentiation, while the logic-formal characteristics of the distinction are framed in the work entitled “On the Type-Token Relationships” (Chapter 1). The basic part of the book deals with issues relating to syntax (Chapters 2-4) and semantics of language (Chapters 5-6), as well as pertaining to syntactic-semantic pragmatic questions (Chapters 7-13). Throughout the book, language, categorial language, is characterized syntactically as generated by classical categorial grammar (Chapter 2) and formalized on two opposing levels: as language of expression-tokens (level of tokens) and language of expression-types (level of types). The author’s considerations contained in Chapters 2 and 4 lead to the important philosophical conclusion that in formal-logical syntactic studies on language the assumption that expression-types constitute the primary language layer while expression-tokens make the secondary one, can be neglected; thus, this speaks in favour of the opposing standpoint—the concretistic one—in the ontology of language syntax. In the works “Meaning and Interpretations”, Parts I and II (Chapters 5 and 6), it is underlined, however, that such semantic concepts as: meaning, denotation and interpretation are defined on the types level, yet their formal definitions require making use of notions of the tokens level. The semantic notions introduced in the above-mentioned articles are also used in the following works of the present selection, under the titles: “Three Principles of Compositionality” and “On Metaknowledge and Truth” (Chapters 7 and 8). They formalize two principles of compositionality that are well known in the literature on the subject, deriving from Frege, i.e. those of meaning and of denotation; they are related to the syntactic principle of compositionality which was introduced by the author. All the three principles are, at the same time, three conditions of homomorphism of categorial language algebra into three kinds of non-standard models of language (one syntactic and two semantic ones: intensional and extensional), which allows introducing three definitions of truthfulness into these models. The next two works in the collection, entitled: “On Language Adequacy” and “What is the Sense in Logic and Philosophy of Language” (Chapters 9 and 10) concern adequacy of categorial language syntax along with its dual semantics: intensional and extensional, and categorial compatibility of any of its syntactic categories with two corresponding semantic categories: intensional and extensional, based on the compatibility the syntactic category of each language expression with the ontological category assigned to its denotatum. The well-known problem of categorial compatibility for first-order quantifiers finds its solution in the paper “Categories of First-Order Quantifiers” (Chapter 11). In the work “Logic and Ontology of Language” (Chapter 12), being in a sense a summary of the considerations presented in the preceding chapters of the book, language is treated as an ontological being, characterized in compliance with the logical conception of language proposed by Ajdukiewicz. Application—like throughout the book—of tools of classical logic and set theory has resulted in emergence of a general formal logical theory of syntax, semantics and pragmatics of language, which takes into account duality in the understanding of linguistic expressions as tokens (concretes) and types (abstract objects). In terms that take into account a functional approach to language itself, there comes out an ontological neutrality of logic with respect to existential assumptions relating to the ontological nature of linguistic expressions and their extra-linguistic ontological counterparts. The issues connected with applying logic while explaining the manner of using linguistic tokens and linguistic types to determine notions of language communication are raised and illustrated in the last chapter of the work, bearing the title “A Logical Conceptualization of Knowledge on the Notion of Language Communication”. (shrink)

In the paper, original formal-logical conception of syntactic and semantic: intensional and extensional senses of expressions of any language L is outlined. Syntax and bi-level intensional and extensional semantics of language L are characterized categorically: in the spirit of some Husserl’s ideas of pure grammar, Leśniewski-Ajukiewicz’s theory syntactic/semantic categories and in accordance with Frege’s ontological canons, Bocheński’s famous motto—syntax mirrors ontology and some ideas of Suszko: language should be a linguistic scheme of ontological reality and simultaneously a tool of its (...) cognition. In the logical conception of language L, its expressions should satisfy some general conditions of language adequacy. The adequacy ensures their unambiguous syntactic and semantic senses and mutual, syntactic, and semantic compatibility, correspondence guaranteed by the acceptance of a postulate of categorial compatibility syntactic and semantic categories of expressions of L. From this postulate, three principles of compositionality follow: one syntactic and two semantic already known to Frege. They are treated as conditions of homomorphism partial algebra of L into algebraic models of L: syntactic, intensional, and extensional. In the paper, they are applied to some expressions with quantifiers. Language adequacy connected with the logical senses described in the logical conception of language L is, of course, an idealization, but only expressions with high degrees of precision of their senses, after due justification, may become theorems of science. (shrink)

Inductively defined structures are ubiquitous in mathematics; their specification is unambiguous and their properties are powerful. All fields of mathematical logic feature these structures prominently: the formula of a language, the set of theorems, the natural numbers, the primitive recursive functions, the constructive number classes and segments of the cumulative hierarchy of sets. -/- This dissertation gives a mathematical characterization of a species of inductively defined structures, called accessible domains, which include all of the above examples except the set of (...) theorems. The concept of an accessible domain comes from Wilfried Sieg's analysis of proof-theoretic practices, starting with his dissertation. In particular, he noticed the special epistemological character of elements of an accessible domain: they can always be uniquely identified with their build-up. Generally, the unique build-up of elements justifies the principles of induction and recursion. -/- I use category theory to give an abstract characterization of accessible domains. I claim that accessible domains are all instances of initial algebras for endofunctors. Grounded in the historical roots of Sieg's discussions, this dissertation shows how the properties of initial algebras for endofunctors and accessible domains coincide in a satisfying and natural way. -/- Filling out this characterization, I show how important examples of accessible domains fit into this broad characterization. I first characterize some accessible domains by relatively simple functors (e.g. finite, polynomial, those that preserve certain colimits) where we can see how iterating the functor can produce the accessible domain. Then I describe accessible domains that result from more involved specifications (e.g. ordinals and segments of the cumulative hierarchies associated with CZF, IZF, and ZF) by relying heavily on algebraic set theory. I end with a discussion of some of the methodological features of category theory in particular that helped characterize accessible domains. (shrink)

There are mathematical structures with elements that cannot be distinguished by the properties they have within that structure. For instance within the field of complex numbers the two square roots of −1, i and −i, have the same algebraic properties in that field. So how do we distinguish between them? Imbedding the complex numbers in a bigger structure, the quaternions, allows us to algebraically tell them apart. But a similar problem appears for this larger structure. There seems to be always (...) a background and a context that we rely upon. Thus mathematicians naturally make use of Kantian intuition and references fixed by names and denotations. I argue that such features cannot be avoided. (shrink)

The Belnap–Dunn logic is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Přenosil and Rivieccio. We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt the point of (...) view ofAlgebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family. In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies. (shrink)