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)

Hyperboolean algebras are Boolean algebras with operators, constructed as algebras of complexes (or, power structures) of Boolean algebras. They provide an algebraic semantics for a modal logic (called here a {\em hyperboolean modal logic}) with a Kripke semantics accordingly based on frames in which the worlds are elements of Boolean algebras and the relations correspond to the Boolean operations. We introduce the hyperboolean modal logic, give a complete axiomatization of it, and show that it lacks the finite model property. The (...) method of axiomatization hinges upon the fact that a "difference" operator is definable in hyperboolean algebras, and makes use of additional non-Hilbert-style rules. Finally, we discuss a number of open questions and directions for further research. (shrink)

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)

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)

Spinor theory and its applications are indispensable in many areas of theoretical physics, especially in quantum mechanics, general relativity, and string theory. Spinors are complex objects that transform under specific representations of the Lorentz or rotation groups, capturing the intrinsic spin properties of particles. Recent developments in mathematical abstraction have provided new insights and tools for exploring spinor dynamics, particularly through the lens of motivic operators and M-Posit transforms. This paper delves into the intricate dynamics of spinors subjected to motivic (...) operators and MPosit transforms. Motivic operators encapsulate intrinsic algebraic properties and perturbations, leading to highly evolved spinor states without reliance on external coordinate systems. The M-Posit transform, a novel operator designed for spinors, leverages fractal morphic properties, topological congruence, and quantum-inspired perturbations to manipulate spinor structures within an infinitedimensional oneness geometry calculus. Drawing on the foundations laid by twistor theory, we aim to redefine the evolution of spinors using intrinsic properties derived from phenomenological velocity equations. By interpreting spinors as self-propelled twistors, we offer new perspectives on spinor transformations and dynamics. This intrinsic approach not only simplifies the mathematical treatment but also enhances the physical and geometric interpretation of spinor behaviors. The structure of this paper is organized as follows: We begin with the formal definition and computation of spinor components using motivic operators, highlighting the steps involved in their transformations. Following this, we introduce the M-Posit transform and explore its application to spinors, providing detailed mathematical formulations and examples. We also examine the implications of these transformations in higher-dimensional twistor spaces and non-commutative structures. Finally, we extend our analysis to practical applications in quantum computing, fractal image processing, and quantum field theory. The potential of spinning theory redefined through motivic operators and M-posit transforms offers promising avenues for further research in various domains of theoretical physics and mathematics. This paper sets a foundation for these explorations, emphasizing the importance of intrinsic properties and algebraic dynamics in understanding complex spinor evolutions. (shrink)

Recent research on algebraic models of _quasi-Nelson logic_ has brought new attention to a number of classes of algebras which result from enriching (subreducts of) Heyting algebras with a special modal operator, known in the literature as a _nucleus_. Among these various algebraic structures, for which we employ the umbrella term _intuitionistic modal algebras_, some have been studied since at least the 1970s, usually within the framework of topology and sheaf theory. Others may seem more exotic, for their primitive (...) operations arise from algebraic terms of the intuitionistic modal language which have not been previously considered. We shall for instance investigate the variety of _weak implicative semilattices_, whose members are (non-necessarily distributive) meet semilattices endowed with a nucleus and an implication operation which is not a relative pseudo-complement but satisfies the postulates of Celani and Jansana’s strict implication. For each of these new classes of algebras we establish a representation and a topological duality which generalize the known ones for Heyting algebras enriched with a nucleus. (shrink)

This paper introduces the novel concept of Neutro-BCK-algebra. In Neutro-BCK-algebra, the outcome of any given two elements under an underlying operation (neutro-sophication procedure) has three cases, such as: appurtenance, non-appurtenance, or indeterminate.

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued (...) trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; (...) inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; fuzzy measure; clustering algorithm; and many more. (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)

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)

In this paper we recall, improve, and extend several definitions, properties and applications of our previous 2019 research referred to NeutroAlgebras and AntiAlgebras (also called NeutroAlgebraic Structures and respectively AntiAlgebraic Structures). Let <A> be an item (concept, attribute, idea, proposition, theory, etc.). Through the process of neutrosphication, we split the nonempty space we work on into three regions {two opposite ones corresponding to <A> and <antiA>, and one corresponding to neutral (indeterminate) <neutA> (also denoted <neutroA>) between the opposites}, which may (...) or may not be disjoint – depending on the application, but they are exhaustive (their union equals the whole space). A NeutroAlgebra is an algebra which has at least one NeutroOperation or one NeutroAxiom (axiom that is true for some elements, indeterminate for other elements, and false for the other elements). A Partial Algebra is an algebra that has at least one Partial Operation, and all its Axioms are classical (i.e. axioms true for all elements). Through a theorem we prove that NeutroAlgebra is a generalization of Partial Algebra, and we give examples of NeutroAlgebras that are not Partial Algebras. We also introduce the NeutroFunction (and NeutroOperation). (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)

Modifying the descriptive and theoretical generalizations of Relativized Minimality, we argue that a significant subset of weak island violations arise when an extracted phrase should scope over some intervener but is unable to. Harmless interveners seem harmless because they can support an alternative reading. This paper focuses on why certain wh-phrases are poor wide scope takers, and offers an algebraic perspective on scope interaction. Each scopal element SE is associated with certain operations (e.g., not with complements). When a wh-phrase scopes (...) over some SE, the operations associated with that SE are performed in its denotation domain. The requisite operations may or may not be available in a domain, however. We present an empirical analysis of a variety of wh-phrases. It is argued that the wh-phrases that escape all weak islands (i.e., can scope over any intervener) are those that range over individuals, the reason being that all Boolean operations are defined for their domain. Collectives, manners, amounts, numbers, etc. all denote in domains with fewer operations and are thus selectively sensitive to scopal interveners—a “semantic relativized minimality effect”. (shrink)

We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known properties, valid in the case of unconditional events, still hold in our approach to logical operations among conditional events. In particular we prove a decomposition formula and a related additive property. Then, we introduce the set of conditional constituents generated by $n$ conditional events and (...) we show that they satisfy the basic properties valid in the case of unconditional events. We obtain a generalized inclusion-exclusion formula, which can be interpreted by introducing a suitable distributive property. Moreover, under logical independence of basic unconditional events, we give two necessary and sufficient coherence conditions. The first condition gives a geometrical characterization for the coherence of prevision assessments on a family F constituted by n conditional events and all possible conjunctions among them. The second condition characterizes the coherence of prevision assessments defined on $F\cup K$, where $K$ is the set of conditional constituents associated with the conditional events in $F$. Then, we give some further theoretical results and we examine some examples and counterexamples. Finally, we make a comparison with other approaches and we illustrate some theoretical aspects and applications. (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)).

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)

The main algebraic foundations of quantum mechanics are quickly reviewed. They have been suggested since the birth of this theory till up to last years. They are the following ones: Heisenberg-Born- Jordan’s (1925), Weyl’s (1928), Dirac’s (1930), von Neumann’s (1936), Segal’s (1947), T.F. Jordan’s (1986), Morchio and Strocchi’s (2009) and Buchholz and Fregenhagen’s (2019). Four cases are stressed: 1) the misinterpretation of Dirac’s algebraic foundation; 2) von Neumann’s ‘conversion’ from the analytic approach of Hilbert space to the algebraic approach of (...) the rings of operators; 3) Morchio and Strocchi’s improving Dirac’s analogy between commutators and Poisson Brackets into an exact equivalence; 4) the recent foundation of quantum mechanics upon the algebra of perturbations. Some considerations on alternating theoretical importance of the algebraic approach in the history of QM are offered. The level of formalism has increased from the mere introduction of matrices to group theory and C*-algebras but has not led to a definition of the foundations of physics; in particular, an algebraic formulation of QM organized as a problem-based theory and an exclusive use of constructive mathematics is still to be discovered. (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)

The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework of point-free topology) (...) give rise to a profusion of topological belief operators that are compatible with the familiar topological knowledge operator. Thereby a canonical topological model for weak KB can be constructed. For this canonical model a truth lemma for the K and B holds such that a completeness theorem for KB can be proved in the familiar way. The second aim of this paper is to show that the topological interpretation of knowledge K comes along with a complete Heyting algebra of belief operators B that all fit the knowledge operator K in the sense that the pairs (K, B) satisfy all axioms of weak KB. This amounts to a pluralistic relation between knowledge and belief: Knowledge does not fully determine belief, rather it designs a conceptual space for belief operators where different (competing) belief operators coexist. (shrink)

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 consider momentum operators on intrinsically curved manifolds. Given that the momentum operators are Killing vector fields whose integral curves are geodesics, it is shown that the corresponding manifold is either flat, or otherwise of compact type with positive constant sectional curvature and dimension equal to 1, 3 or 7. Explicit representations of momentum operators and the associated Casimir element will be discussed for the 3-sphere. It will be verified that the structure constants of the underlying Lie algebra are (...) proportional to 2ħ/R, where R is the curvature radius of the sphere. This results in a countable energy and momentum spectrum of freely moving particles. It is shown that the maximum resolution of the possible momenta is given by the de-Broglie wave length λ=πR, which is identical to the diameter of the manifold. The corresponding covariant position operators are defined in terms of geodesic normal coordinates and the associated commutator relations of position and momentum are established. (shrink)

We review our approach to quantum mechanics adding also some new interesting results. We start by giving proof of two important theorems on the existence of the A(Si) and i,±1 N Clifford algebras. This last algebra gives proof of the von Neumann basic postulates on the quantum measurement explaining thus in an algebraic manner the wave function collapse postulated in standard quantum theory. In this manner we reach the objective to expose a self-consistent version of quantum mechanics. In detail (...) we realize a bare bone skeleton of quantum mechanics recovering all the basic foundations of this theory on an algebraic framework. We give proof of the quantum like Heisenberg uncertainty relations using only the basic support of the Clifford algebra. In addition we demonstrate the well known phenomenon of quantum Mach Zender interference using the same algebraic framework, as well as we give algebraic proof of quantum collapse in some cases of physical interest by direct application of the theorem that we derive to elaborate the i,±1 N algebra. We also discuss the problem of time evolution of quantum systems as well as the changes in space location, in momentum and the linked invariance principles. We are also able to re-derive the basic wave function of standard quantum mechanics by using only the Clifford algebraic approach. In this manner we obtain a full exposition of standard quantum mechanics using only the basic axioms of Clifford algebra. We also discuss more advanced features of quantum mechanics. In detail, we give demonstration of the Kocken-Specher theorem, and also we give an algebraic formulation and explanation of the EPR paradox only using the Clifford algebra. By using the same approach we also derive Bell inequalities. Our formulation is strongly based on the use of idempotents that are contained in Clifford algebra. Their counterpart in quantum mechanics is represented by the projection operators that, as it is well known, are interpreted as logical statements, following the basic von Neumann results. Von Neumann realized a matrix logic on the basis of quantum mechanics. Using the Clifford algebra we are able to invert such result. According to the results previously obtained by Orlov in 1994, we are able to give proof that quantum mechanics derives from logic. We show that indeterminism and quantum interference have their origin in the logic. Therefore, it seems that we may conclude that quantum mechanics, as it appears when investigated by the Clifford algebra, is a two-faced theory in the sense that it looks from one side to “matter per se”, thus to objects but simultaneously also to conceptual entities. We advance the basic conclusion of the paper: There are stages of our reality in which we no more can separate the logic ( and thus cognition and thus conceptual entity) from the features of “matter per se”. In quantum mechanics the logic, and thus the cognition and thus the conceptual entity-cognitive performance, assume the same importance as the features of what is being described. We are at levels of reality in which the truths of logical statements about dynamic variables become dynamic variables themselves so that a profound link is established from its starting in this theory between physics and conceptual entities. Finally, in this approach there is not an absolute definition of logical truths. Transformations , and thus … “redefinitions”…. of truth values are permitted in such scheme as well as the well established invariance principles, clearly indicate . (shrink)

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel (...) 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

This paper aims to clarify Merleau-Ponty’s contribution to an embodied-enactive account of mathematical cognition. I first identify the main points of interest in the current discussions of embodied higher cognition and explain how they relate to Merleau-Ponty and his sources, in particular Husserl’s late works. Subsequently, I explain these convergences in greater detail by more specifically discussing the domains of geometry and algebra and by clarifying the role of gestalt psychology in Merleau-Ponty’s account. Beyond that, I explain how, for (...) Merleau-Ponty, mathematical cognition requires not only the presence and actual manipulation of some concrete perceptible symbols but, more strongly, how it is fundamentally linked to the structural transformation of the concrete configurations of symbolic systems to which these symbols appertain. Furthemore, I fill a gap in the literature by explaining Merleau-Ponty’s claim that these structural transformations are operated through motor intentionality. This makes it possible, in turn, to contrast Merleau-Ponty’s approach to ontologically idealistic and realistic views on mathematical objects. On Merleau-Ponty’s account, mathematical objects are relational entities, that is, gestalts that necessarily imply situated cognizers to whom they afford a specific type of engagement in the world and on whom they depend in their eventual structural transformations. I argue that, by attributing a strongly constitutive role to phenomenal configurations and their motor transformation in mathematical thinking, Merleau-Ponty contributes to clarifying the worldly, historical, and socio-cultural aspects of mathematical truths without compromising what we perceive as their universality, certainty, and necessity. (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)

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 (...) class='Hi'>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)

This article is a preliminary draft for initiating and commencing a new pioneer dimension of expression. To deal with higher-dimensional data or information flowing in this modern era of information technology and artificial intelligence, some innovative super algebraic structures are essential to be formulated. In this paper, we have introduced such matrices that have multiple layers and clusters of layers to portray multi-dimensional data or massively dispersed information of the plithogenic universe made up of numerous subjects their attributes, and sub-attributes. (...) For grasping that field of parallel information, events, and realities flowing from the micro to the macro level of universes, we have constructed hypersoft and hyper-super-soft matrices in a Plithogenic Fuzzy environment. These Matrices classify the non-physical attributes by accumulating the physical subjects and further sort the physical subjects by accumulating their non-physical attributes. We presented themasPlithogenicAttributiveSubjectivelyWholeHyper-Super-Soft-Matrix(PASWHSS-Matrix)andPlithogenic Subjective Attributively Whole-Hyper-Super-Soft-Matrix (PSAWHSS-Matrix). Several types of views and level-layers of these matrices are described. In addition, some local aggregation operators for Plithogenic Fuzzy Hypersoft Set (PPFHS-Set) are developed. Finally, few applications of these matrices and operators are used as numerical examples of COVID-19 data structures. (shrink)

This essay explores the concept of emergence within the framework of noncommutative systems, challenging traditional views that tie emergent behaviour to commutative rule sets. Emergence typically refers to the phenomena where higher-level complexity arises from the interactions of simpler components, often under deterministic and commutative systems. However, noncommutative systems, where the order of operations affects the outcome, introduce a unique layer of complexity that complicates this understanding. By examining the properties of noncommutative systems through formal mathematical analysis and exploring case (...) studies from quantum mechanics, this essay investigates whether emergence can genuinely arise under noncommutative conditions. The findings suggest that noncommutative rule sets lead to a richer and more intricate form of emergent behaviour, characterised by path dependence and sequence sensitivity. This challenges our existing models of complexity and opens up new pathways for understanding emergent phenomena in both physical and cognitive systems. The implications of this analysis extend beyond theoretical curiosity, suggesting that emergent properties may exist in unexpected and non-linear domains, reshaping our perception of order, chaos, and complexity. (shrink)

In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest in (...) exploring the foundations of multialgebras applied to the study of logic systems. -/- It is well known from universal algebra that, for every signature Sigma, there exist algebras over Sigma which are absolutely free, meaning that they do not satisfy any identities or, alternatively, satisfy the universal mapping property for the class of Sigma-algebras. Furthermore, once we fix a cardinality of the generating set, they are, up to isomorphisms, unique, and equal to algebras of terms (or propositional formulas, in the context of logic). Equivalently, the forgetful functor, from the category of Sigma-algebras to Set, has a left adjoint. This result does not extend to multialgebras. Not only multialgebras satisfying the universal mapping property do not exist, but the forgetful functor U, from the category of Sigma-multialgebras to Set, does not have a left adjoint. -/- In this paper we generalize, in a natural way, algebras of terms to multialgebras of terms, whose family of submultialgebras enjoys many properties of the former. One example is that, to every pair consisting of a function, from a submultialgebra of a multialgebra of terms to another multialgebra, and a collection of choices (which selects how a homomorphism approaches indeterminacies), there corresponds a unique homomorphism, what resembles the universal mapping property. Another example is that the multialgebras of terms are generated by a set that may be viewed as a strong basis, which we call the ground of the multialgebra. Submultialgebras of multialgebras of terms are what we call weakly free multialgebras. Finally, with these definitions at hand, we offer a simple proof that multialgebras with the universal mapping property for the class of all multialgebras do not exist and that U does not have a left adjoint. (shrink)

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)

In this paper it is shown that Heyting and Co-Heyting mereological systems provide a convenient conceptual framework for spatial reasoning, in which spatial concepts such as connectedness, interior parts, (exterior) contact, and boundary can be defined in a natural and intuitively appealing way. This fact refutes the wide-spread contention that mereology cannot deal with the more advanced aspects of spatial reasoning and therefore has to be enhanced by further non-mereological concepts to overcome its congenital limitations. The allegedly unmereological concept of (...) boundary is treated in detail and shown to be essentially affected by mereological considerations. More precisely, the concept of boundary turns out to be realizable in a variety of different mereologically grounded versions. In particular, every part K of a Heyting algebra H gives rise to a well-behaved K-relative boundary operator. (shrink)

We indicate a new way in the solution of the problem of the quantum measurement . In past papers we used the well-known formalism of the density matrix using an algebraic approach in a two states quantum spin system S, considering the particular case of three anticommuting elements. We demonstrated that, during the wave collapse, we have a transition from the standard Clifford algebra, structured in its space and metrics, to the new spatial structure of the Clifford dihedral (...) class='Hi'>algebra. This structured geometric transition, which occurs during the interaction of the S system with the macroscopic measurement system M, causes the destruction of the interferential factors. In the present paper we construct a detailed model of the (S+M) interaction evidencing the particular role of the Time Ordering in the (S+M) coupling since we have a time asymmetric interaction . We demonstrate that , during the measurement , the physical circumstance that the fermion creation and annihilation operators of the S system must be destroyed during such interaction has a fundamental role . (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, (...) undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

A formal theory of oppositions and opposites is proposed on the basis of a non- Fregean semantics, where opposites are negation-forming operators that shed some new light on the connection between opposition and negation. The paper proceeds as follows. After recalling the historical background, oppositions and opposites are compared from a mathematical perspective: the first occurs as a relation, the second as a function. Then the main point of the paper appears with a calculus of oppositions, by means of a (...) non-Fregean semantics that redefines the logical values of various sorts of sentences. A num- ber of topics are then addressed in the light of this algebraic semantics, namely: how to construct value-functional operators for any logical opposition, beyond the classical case of contradiction; Blanché's "closure problem", i.e., how to find a complete structure connecting the sixteen binary sentences with one another. All of this is meant to devise an abstract theory of opposition: it encompasses the relation of consequence as subalternation, while relying upon the use of a primary "proto- negation" that turns any relatum into an opposite. This results in sentential negations that proceed as intensional operators, while negation is broadly viewed as a difference-forming operator without special constraints on it. (shrink)

2006. George Boole. Encyclopedia of Philosophy. 2nd edition. Detroit: Macmillan Reference USA. -/- George Boole (1815-1864), whose name lives among modern computer-related sciences in Boolean Algebra, Boolean Logic, Boolean Operations, and the like, is one of the most celebrated logicians of all time. Ironically, his actual writings often go unread and his actual contributions to logic are virtually unknown—despite the fact that he was one of the clearest writers in the field. Working with various students including Susan Wood and (...) Sriram Nambiar, I have written several publications trying to set the record straight—but so far to little avail. This encyclopedia entry is one more attempt to set the record straight in a way that can be appreciated by non-experts.Also see https://www.academia.edu/10161999/Booles_criteria_of_validity_and_invalidity . (shrink)

In contemporary mathematics, a Colombeau algebra of Colombeau generalized functions is an algebra of a certain kind containing the space of Schwartz distributions. While in classical distribution theory a general multiplication of distributions is not possible, Colombeau algebras provide a rigorous framework for this. Remark 1.1.1.Such a multiplication of distributions has been a long time mistakenly believed to be impossible because of Schwartz’ impossibility result, which basically states that there cannot be a differential algebra containing the space (...) of distributions and preserving the product of continuous functions. However, if one only wants to preserve the product of smooth functions instead such a construction becomes possible, as demonstrated first by J.F.Colombeau [1],[2]. As a mathematical tool, Colombeau algebras can be said to combine a treatment of singularities, differentiation and nonlinear operations in one framework, lifting the limitations of distribution theory. These algebras have found numerous applications in the fields of partial differential equations, geophysics, microlocal analysis and general relativity so far. (shrink)

In a previous work we studied, from the perspective ofAlgebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice language. We prove that this logic is algebraizable and investigate its algebraic models, which turn out to be distributive bilattices with additional implication (...) operations. We axiomatize and state several results on these new classes of algebras, in particular representation theorems analogue to the well-known one for interlaced bilattices. (shrink)

George Boole emerged from the British tradition of the “New Analytic”, known for the view that the laws of logic are laws of thought. Logicians in the New Analytic tradition were influenced by the work of Immanuel Kant, and by the German logicians Wilhelm Traugott Krug and Wilhelm Esser, among others. In his 1854 work An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities, Boole argues that the laws of thought acquire (...) normative force when constrained to mathematical reasoning. Boole’s motivation is, first, to address issues in the foundations of mathematics, including the relationship between arithmetic and algebra, and the study and application of differential equations (Durand-Richard, van Evra, Panteki). Second, Boole intended to derive the laws of logic from the laws of the operation of the human mind, and to show that these laws were valid of algebra and of logic both, when applied to a restricted domain. Boole’s thorough and flexible work in these areas influenced the development of model theory (see Hodges, forthcoming), and has much in common with contemporary inferentialist approaches to logic (found in, e.g., Peregrin and Resnik). (shrink)

In this paper we consider the logics L(i,n) obtained from the (n+1)-valued Lukasiewicz logics L(n+1) by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analyzed. We present a very general theorem that provides sufficient conditions for maximality between logics. As a consequence of this theorem, it is shown that L(i,n) is maximal w.r.t. CPL whenever n is prime. Concerning strong maximality (i.e. maximality w.r.t. (...) rules instead of only axioms), we provide algebraic arguments in order to show that the logics L(i,n) are not strongly maximal w.r.t. CPL, even for n prime. Indeed, in such case, we show that there is just one extension between L(i,n) and CPL obtained by adding to L(i,n) a kind of graded explosion rule. Finally, using these results, we show that the logics L(i,n) with n prime and i/n < 1/2 are ideal paraconsistent logics. (shrink)

Abstract. The aim of this paper is to present a topological method for constructing discretizations (tessellations) of conceptual spaces. The method works for a class of topological spaces that the Russian mathematician Pavel Alexandroff defined more than 80 years ago. Alexandroff spaces, as they are called today, have many interesting properties that distinguish them from other topological spaces. In particular, they exhibit a 1-1 correspondence between their specialization orders and their topological structures. Recently, a special type of Alexandroff spaces was (...) used by Ian Rumfitt to elucidate the logic of vague concepts in a new way. According to his approach, conceptual spaces such as the color spectrum give rise to classical systems of concepts that have the structure of atomic Boolean algebras. More precisely, concepts are represented as regular open regions of an underlying conceptual space endowed with a topological structure. Something is subsumed under a concept iff it is represented by an element of the conceptual space that is maximally close to the prototypical element p that defines that concept. This topological representation of concepts comes along with a representation of the familiar logical connectives of Aristotelian syllogistics in terms of natural settheoretical operations that characterize regular open interpretations of classical Boolean propositional logic. In the last 20 years, conceptual spaces have become a popular tool of dealing with a variety of problems in the fields of cognitive psychology, artificial intelligence, linguistics and philosophy, mainly due to the work of Peter Gärdenfors and his collaborators. By using prototypes and metrics of similarity spaces, one obtains geometrical discretizations of conceptual spaces by so-called Voronoi tessellations. These tessellations are extensionally equivalent to topological tessellations that can be constructed for Alexandroff spaces. Thereby, Rumfitt’s and Gärdenfors’s constructions turn out to be special cases of an approach that works for a more general class of spaces, namely, for weakly scattered Alexandroff spaces. This class of spaces provides a convenient framework for conceptual spaces as used in epistemology and related disciplines in general. Alexandroff spaces are useful for elucidating problems related to the logic of vague concepts, in particular they offer a solution of the Sorites paradox (Rumfitt). Further, they provide a semantics for the logic of clearness (Bobzien) that overcomes certain problems of the concept of higher2 order vagueness. Moreover, these spaces help find a natural place for classical syllogistics in the framework of conceptual spaces. The crucial role of order theory for Alexandroff spaces can be used to refine the all-or-nothing distinction between prototypical and nonprototypical stimuli in favor of a more fine-grained gradual distinction between more-orless prototypical elements of conceptual spaces. The greater conceptual flexibility of the topological approach helps avoid some inherent inadequacies of the geometrical approach, for instance, the so-called “thickness problem” (Douven et al.) and problems of selecting a unique metric for similarity spaces. Finally, it is shown that only the Alexandroff account can deal with an issue that is gaining more and more importance for the theory of conceptual spaces, namely, the role that digital conceptual spaces play in the area of artificial intelligence, computer science and related disciplines. Keywords: Conceptual Spaces, Polar Spaces, Alexandroff Spaces, Prototypes, Topological Tessellations, Voronoi Tessellations, Digital Topology. (shrink)

This is the only complete logic for properties, relations, and propositions (PRPS) that has been formulated to date. First, an intensional abstraction operation is adjoined to first-order quantifier logic, Then, a new algebraic semantic method is developed. The heuristic used is not that of possible worlds but rather that of PRPS taken at face value. Unlike the possible worlds approach to intensional logic, this approach yields a logic for intentional (psychological) matters, as well as modal matters. At the close of (...) the paper, the origin of incompleteness in logic is investigated. The culprit is found to be the predication relation, a relation on properties and relations that is expressed in natural language by the copula. (shrink)

Ways of Scope Taking is concerned with syntactic, semantic and computational aspects of scope. Its starting point is the well-known but often neglected fact that different types of quantifiers interact differently with each other and other operators. The theoretical examination of significant bodies of data, both old and novel, leads to two central claims. (1) Scope is a by-product of a set of distinct Logical Form processes; each quantifier participates in those that suit its particular features. (2) Scope interaction is (...) further constrained by the semantics of the interacting operators. The arguments are developed using Minimalist syntax, Generalized Quantify theory, Discourse Representation Theory, and algebraic semantics. The contributors (Beghelli, Ben-Shalom, Doetjes, Farkas, Gutiérrez Rexach, Honcoop, Stabler, Stowell, Szabolcsi and Zwarts) make tightly related theoretical assumptions and focus on related empirical phenomena, which include the direct and inverse scope of quantifiers, distributivity, negation, modal and intensional contexts, weak islands, event-related readings, interrogatives, wh/quantifier interactions, and Hungarian syntax. An introduction to the formal semantics background is provided. Audience: Linguists, philosophers, computational and psycholinguists; advanced undergraduates, graduate students and researchers in these fields. (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)

Higher-order theories of properties, relations, and propositions are known to be essentially incomplete relative to their standard notions of validity. It turns out that the first-order theory of PRPs that results when first-order logic is supplemented with a generalized intensional abstraction operation is complete. The construction involves the development of an intensional algebraic semantic method that does not appeal to possible worlds, but rather takes PRPs as primitive entities. This allows for a satisfactory treatment of both the modalities and the (...) propositional attitudes, and it suggests a general strategy for developing a comprehensive treatment of intensional logic. (shrink)

The paper aims to establish if Grassmann’s notion of an extensive form involved an epistemological change in the understanding of geometry and of mathematical knowledge. Firstly, it will examine if an ontological shift in geometry is determined by the vectorial representation of extended magnitudes. Giving up homogeneity, and considering geometry as an application of extension theory, Grassmann developed a different notion of a geometrical object, based on abstract constraints concerning the construction of forms rather than on the homogeneity conditions required (...) by the modern version of the theory of proportions. Secondly, Grassmann’s conception of mathematical knowledge will be investigated. Parting from the traditional definition of mathematics as a science of magnitudes, Grassmann considered mathematical forms as particulars rather than universals: the classification of the branches of mathematics was thus based on different operational rules, rather than on empirical criteria of abstraction or on the distinction of different species belonging to a common genus. It will be argued that a different notion of generalization is thus involved, and that the knowledge of mathematical forms relies on the understanding of the rules of generation of the forms themselves. Finally, the paper will analyse if Grassmann’s approach in the first edition of the Ausdehnungslehre should be explained in terms of the notion of purity of method, and if it clashes with Grassmann’s later conventionalism. Although in the second edition the features of the operations are chosen by convention, as it is the case for the anti-commutative property of the multiplication, the choice is oriented by our understanding of the resulting forms: a simplification in the algebraic calculus need not correspond to a simplification in the ‘dimensional’ interpretation of the result of the multiplicative operation. (shrink)

In this paper one introduces for the first time the IndetermSoft Set, as extension of the classical (determinate) Soft Set, that deals with indeterminate data, and similarly the HyperSoft Set extended to IndetermHyperSoft Set, where ‘Indeterm’ stands for ‘Indeterminate’ (uncertain, conflicting, not unique outcome). They are built on an IndetermSoft Algebra that is an algebra dealing with IndetermSoft Operators resulted from our real world. Afterwards, the corresponding Fuzzy / Intuitionistic Fuzzy / Neutrosophic / and other fuzzy-extension IndetermSoft Set (...) & IndetermHyperSoft Set are presented together with their applications. (shrink)

This paper presents for the first time the IndetermSoft Set, as an extension of the classical (determinate) Soft Set, which operates on indeterminate data, and similarly the HyperSoft Set extended to the IndetermHyperSoft Set, where 'Indeterm' means 'Indeterminate' (uncertain, conflicting, non-unique result). They are built on an IndetermSoft Algebra which is an algebra dealing with IndetermSoft Operators resulting from our real world. Subsequently, the IndetermSoft and IndetermHyperSoft Sets and their Fuzzy/Fuzzy Intuitionistic/Neutrosophic and other fuzzy extensions and their applications (...) are presented. (shrink)

A general characterization of logical opposition is given in the present paper, where oppositions are defined by specific answers in an algebraic question-answer game. It is shown that opposition is essentially a semantic relation of truth values between syntactic opposites, before generalizing the theory of opposition from the initial Apuleian square to a variety of alter- native geometrical representations. In the light of this generalization, the famous problem of existential import is traced back to an ambiguous interpretation of assertoric sentences (...) in Aristotle's traditional logic. Following Abelard’s distinction between two alternative readings of the O-vertex: Non omnis and Quidam non, a logical difference is made between negation and denial by means of a more fine- grained modal analysis. A consistent treatment of assertoric oppositions is thus made possible by an underlying abstract theory of logical opposition, where the central concept is negation. A parallel is finally drawn between opposition and consequence, laying the ground for future works on an abstract operator of opposition that would characterize logical negation just as does Tarski’s operator of consequence for logical truth. (shrink)

Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation can be (...) also interpreted as purely mathematical or logical “force” or “interaction” as a corollary from its ontomathematical (rather than physical) realization. The ontomathematical approach to gravitation is implicit in general relativity equating it to operators in pseudo-Riemannian space obeying the Einstein field equation and also well-known by the “geometrization of physics”. Quantum mechanics shares the same by the separable complex Hilbert space and defining “physical quantity” by the Hermitian operators on it. One can interpret special Minkowski space involved by special relativity and the qubit Hilbert space of quantum information as Fourier counterparts immediately noticing that general relativity means gravitation as the Fourier counterpart of non-Hermitian operators implying non-unitarity and the violation of energy conservation and thus destroying Pauli’s particle paradigm. Since the Standard model obeys it, this explains the impossibility of “quantum gravitation” in any framework conservatively generalizing the Standard model so that it would include gravitation along with electromagnetic, weak, and strong interactions. Einstein’s geometrization of gravitation can be continued into a purely mathematical theory of it following Euclid’s realization for geometry to be exhaustively built in a deductive and axiomatic way as well as Riemann’s parametrization of all the class of Euclidean and non-Euclidean geometries by “space curvature”, then being generalized to Minkowski space as the operators on pseudo-Riemannian space as the Einstein field equation means gravitation. The transition from mathematical gravitation to logical one can rely on the historical lesson of the pair of Lobachevski’s and Riemann’s approaches now “reversely”, i.e., from the latter to the former. Logical gravitation is linkable to Hegel’s dialectical logic and ontological dialectics abandoning their interpretations as a new zero logic substituting classical propionyl logic. The approach of ontomathematics generalizing that of ontology, traceable even to Aristotle’s reformation of Plato’s doctrine, needs Hegel’s doctrine to be formalized as a first-order logic naturally containing Boolean algebra, isomorphic to both classical propositional logic and set theory being the class of all first-order logics, as a sub-logic along with Peano arithmetic as another sub-logic. The first-order logic at issue is called Hilbert arithmetic and elaborated in detail in other papers. It allows for both self-foundation of mathematics to be internally proved as complete and furthermore, quantum mechanics reinterpreted as quantum information to be included by the qubit Hilbert space interpretable in turn as a dual and physical counterpart of Hilbert arithmetic in a narrow sense, that is, both counterparts constitute Hilbert arithmetic in a wide sense, being mathematical and physical simultaneously and thus overcoming the Cartesian dualism of “body” gapped from “mind” by an abyss. Then, the proper philosophical interpretation of gravitation to be the fundamental ontomathematical force or interaction overcomes the ridiculous belief of the Big Bang wrongly alleged to be a scientific theory. Ontomathematical gravitation suggests an omnipresent and omnitemporal medium of “God’s” creation “ex nihilo” following only the natural necessity of quantum-information conservation particularly and locally manifested as energy conservation. (shrink)