Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are given. (...) Specifically, a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

Abstract. First-year mathematics education students often face challenges with College and Advanced Algebra assessments. This study aimed to develop and validate a 100-item multiple-choice midterm test for College and Advanced Algebra, ensuring the test's validity and reliability. The test was designed following a structured process that included creating a Table of Specifications (TOS) based on the approved syllabus. To ensure content accuracy and relevance, the test was reviewed by three subject matter experts and evaluated for clarity by (...) 15 students. Pilot testing was conducted with 82 fourth-year Bachelor of Secondary Education Mathematics (BSEd Mathematics) students. The pilot test results underwent detailed item analysis, focusing on metrics such as the difficulty index, discrimination index, and overall reliability using the Kuder-Richardson Formula 20 (KR-20). Of the 100 items, 22 were retained, 48 were revised, and 30 were discarded. The test achieved a reliability coefficient of 0.876, indicating strong internal consistency. The findings suggest that the validated test questionnaire is a dependable tool for accurately assessing students’ knowledge in College and Advanced Algebra, providing valuable feedback for educators and students. (shrink)

We define emergence algebraically in the context of discrete dynamical systems modeled as transformation semigroups. Emergence happens when a quotient structure (coarse-grained dynamics) is not a substructure of the original system. We survey small groups to show that algebraic emergence is neither ubiquitous nor rare. Then, we describe connections with hierarchical decompositions and explore some of the philosophical implications of the algebraic constraints.

We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of game terms to a (...) certain ‘minimal canonical form’, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities. (shrink)

Abstract. Let REL(O*E) be the relation algebra of binary relations defined on the Boolean algebra O*E of regular open regions of the Euclidean plane E. The aim of this paper is to prove that the canonical contact relation C of O*E generates a subalgebra REL(O*E, C) of REL(O*E) that has infinitely many elements. More precisely, REL(O*,C) contains an infinite family {SPPn, n ≥ 1} of relations generated by the relation SPP (Separable Proper Part). This relation can be (...) used to define point-free concept of connectedness that for the regular open regions of E coincides with the standard topological notion of connectedness, i.e., a region of the plane E is connected in the sense of topology if and only if it has no separable proper part. Moreover, it is shown that the contact relation algebra REL(O*E, C) and the relation algebra REL(O*E, NTPP) generated by the non-tangential proper parthood relation NTPP, coincide. This entails that the allegedly purely topological notion of connectedness can be defined in mereological terms. (shrink)

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.

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)

If there is an area of discourse in which disagreement is virtually absent, it is mathematics. After all, mathematicians justify their claims with deductive proofs: arguments that entail their conclusions. But is mathematics really exceptional in this respect? Looking at the history and practice of mathematics, we soon realize that it is not. First, deductive arguments must start somewhere. How should we choose the starting points (i.e., the axioms)? Second, mathematicians, like the rest of us, are fallible. Their ability to (...) recognize whether a putative proof is correct is not infallible. In most cases, disagreement over the correctness of a putative proof is, however, evanescent. Once an error is spotted and communicated, the disagreement disappears. But this is not always the case. Sometimes it is recalcitrant; that is, it persists over time. In order to zoom in on this type of disagreement and explain its very possibility, we focus on a single case study: a decades-long (1921-1949) controversy between Federigo Enriques and Francesco Severi, two prominent exponents of the Italian school of algebraic geometry. We suggest that the instability of the mathematical community to which they belonged can be explained by the gap between an abstract criterion of rigor and local criteria of acceptability. It is this instability that made the existence of recalcitrant disagreement over putative proofs possible. We do not condemn speculative mathematics but rather its pretense of being rigorous mathematics. In this respect, we show that the overly self-confident Severi and the more intuitive, visionary Enriques had a completely different attitude. (shrink)

Linear Algebra is an extremely important field that extends everyday concepts about geometry and algebra into higher spaces. This text serves as a gentle motivating introduction to the principles (and philosophy) behind linear algebra. This is aimed at undergraduate students taking a linear algebra class - in particular engineering students who are expected to understand and use linear algebra to build and design things, however it may also prove helpful for philosophy majors and anyone else (...) interested in the ideas behind linear algebra. Linear algebra is used extensively in statistics, mechanical engineering, circuit theory, signal processing, economics and data science/machine learning. I have found in my teaching career that students tend to struggle the most with motivating the "why" behind the abstract concepts discussed in linear algebra. This can be difficult for professors to understand because we are so used to using the language of linear algebra we take for granted why these questions are important in the first place. In other words, we may understand the “why” (after years of using these tools), but our students may not. This text seeks to explain this “why” in an accessible, engaging way. (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)

This paper is concerned with the construction of theories of software systems yielding adequate predictions of their target systems’ computations. It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions. Empirical theories of software systems are here introduced semantically, in terms of a hierarchy of computational models that are supplied by formal methods and testing techniques in computer science. Both deductive top-down and inductive bottom-up approaches in the discovery of (...) semantic software theories are refused to argue in favour of the abductive process of hypothesising and refining models at each level in the hierarchy, until they become satisfactorily predictive. Empirical theories of computational systems are required to be modular, as modular are most software verification and testing activities. We argue that logic relations must be thereby defined among models representing different modules in a semantic theory of a modular software system. We exclude that scientific structuralism is able to define module relations needed in software modular theories. The algebraic Theory of Institutions is finally introduced to specify the logic structure of modular semantic theories of computational systems. (shrink)

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of (...) class='Hi'>abstract algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (shrink)

Abstract-In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values true and false, usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. From Poincaré to Turing mathematics is developed at the basis of the fundamental processes.

What is cognition? Equivalently, what is cognition good for? Or, what is it that would not be but for human cognition? But for human cognition, there would not be science. Based on this kinship between individual cognition and collective science, here we put forward Isbell conjugacy---the adjointness between objective geometry and subjective algebra---as a scientific method for developing cognitive science. We begin with the correspondence between categorical perception and category theory. Next, we show how the Gestalt maxim is subsumed (...) by the mathematical construct of colimit, a generalization of summation. The universal mapping property definitions of mathematical constructs, by virtue of being the best with respect to the universe of discourse, can be learned using reinforcement learning algorithms, which raises the possibility of abstracting the architecture of mathematics by artificial intelligence. Subsequently, we present naturality (to be contrasted with miracles), understood as 'Becoming consistent with Being', which governs the transformations of both things and their theories, as the zeroth law of change. Furthermore, the contrast---physical [mechanism] vs. biological [organism]---is smoothed via natural transformation, wherein transformations are respectful of the cohesion of the objects transformed. In closing, upon recognizing the scientific value of learning difficult-to-master differential calculus by physicists, of learning a strange four-letter language by biologists, and of learning the grammar of our respective mother tongues, we make a case for learning the theory of naturality / category theory for developing cognitive science. (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)

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)

Abstract: The intent of this paper is to provide a simple focus on that math- ematical concept and solution, phenomenological velocity to shine light on a worthy topic for mathematicians and physicists alike. Phenomenological Veloc- ity is essential to the formulation of a gestalt cosmology. The bibliography of this paper provides references to the extensive research that has been conducted by myself on the topic. I have performed conditional integrals of the phenomeno- logical velocity in its most liberated standard-algebraic (...) form, I have shown that the computational-phenomenological velocity satisfies its real-analytic solution when not using the speed of light in scientific notation to get the computational version, thus demonstrating that it is a valid solution. So, phenomenological velocity has profound consequences to the foundations of physics as civilization moves into a galactic scale and information is communicated at the quantum level, because it is such a mathematical reality it ought not be ignored when considering topics from hidden dimensions (a real, algebraic technique) and rel- ativity to gravity and dark matter. It gives us a new perspective on how we perceive the meaning of velocity itself with pragnanz, and thus with the new meaning, perspectives can change. I hope the reader will investigate the com- bined research I have performed on this topic, available by referencing the works in this bibliography to fully understand the nature of the arguments being made within. So, this points the right direction for future research, perhaps even with intent to encourage experimental design. (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)

Abstract: In this paper, we study a new notion of fuzzy subimplicative ideal of a BH-algebra, namely fuzzy subimplicative ideal with respect to an element in BH-algebra is introduced and some related properties are investigated.

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be represented for investigation by means (...) of automated theorem provers and finite model builders. The fundamental theorem of Leibniz’s theory is derived using these tools. (shrink)

The concept and usage of the word 'metric' within General Relativity is briefly described. The early work of Roy Kerr led to his original 1963 algebraic, rotating metric. This discovery and his subsequent recollection in 2008 are summarised as the motivation for this article. Computer algebra has confirmed that nominal transformations of this early metric can generate further natural algebraic metrics. The algebra is not abstract, nor advanced, and these metrics have been overlooked for many years. The (...) 1916 metric due to Schwarzschild misled Kerr into seeking a similar metric for rotation. The philosophy of astrophysics for Penrose, Hawking and others would have been very different had they used the two lost metrics. (shrink)

Abstract. The aim of this paper is to show that the topological interpretation of knowledge as an interior kernel operator K of a topological space (X, OX) comes along with a partially ordered family of belief modalities B that fit K in the sense that the pairs (K, B) satisfy all axioms of Stalnaker’s KB logic of knowledge and belief with the exception of the contentious axiom of negative introspection (NI). The new belief modalities B introduced in this paper (...) are defined with the help of the (dense) nuclei of the Heyting algebra OX of open subsets on the topological space (X, OX). In this way, the natural context for the belief operators B related to topological knowledge operator K is shown to be the Heyting algebra NUC(OX) of the nuclei of the Heyting algebra OX.1 More precisely, the dense nuclei of NUC(OX) can be used to define a variety of bimodal logics of knowledge operators K and belief operators B. The operators K and B are compatible with each other in the sense that the pairs (K, B) satisfy all axioms of Stalnaker’s KB system with the exception of the axiom (NI). Therefore, for (X, OX), one obtains a bounded, partially ordered family of belief operators B defined by the elements of NUC(OX). (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 two-dimensional (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)

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be represented for investigation by means (...) of automated theorem provers and finite model builders. The fundamental theorem of Leibniz’s theory is derived using these tools. (shrink)

In the paper we discuss different intuitions about the properties of obligatory actions in the framework of deontic action logic based on boolean algebra. Two notions of obligation are distinguished–abstract and processed obligation. We introduce them formally into the system of deontic logic of actions and investigate their properties and mutual relations.

This work is a conceptual analysis of certain recent developments in the mathematical foundations of Classical and Quantum Mechanics which have allowed to formulate both theories in a common language. From the algebraic point of view, the set of observables of a physical system, be it classical or quantum, is described by a Jordan-Lie algebra. From the geometric point of view, the space of states of any system is described by a uniform Poisson space with transition probability. Both these (...) structures are here perceived as formal translations of the fundamental twofold role of properties in Mechanics: they are at the same time quantities and transformations. The question becomes then to understand the precise articulation between these two roles. The analysis will show that Quantum Mechanics can be thought as distinguishing itself from Classical Mechanics by a compatibility condition between properties-as-quantities and properties-as-transformations. -/- Moreover, this dissertation shows the existence of a tension between a certain "abstract way" of conceiving mathematical structures, used in the practice of mathematical physics, and the necessary capacity to specify particular states or observables. It then becomes important to understand how, within the formalism, one can construct a labelling scheme. The “Chase for Individuation” is the analysis of different mathematical techniques which attempt to overcome this tension. In particular, we discuss how group theory furnishes a partial solution. (shrink)

In this paper, I present two crucial problems for Wolff’s metaphysics of quantities: 1) The structural identification problem and 2) the Pythagorean problem. The former is the problem of uniquely defining a general algebraic structure for all quantities; the latter is the problem of distinguishing physical quantitative structure from mathematical quantities. While Wolff seems to have a consistent and elegant solution to the first problem, the second problem may put in jeopardy his metaphysical view on quantities as spaces. After drawing (...) a parallelism between Wolff’s treatment of quantitative structures and Frege’s conception of quantitative domain, I propose a solution to the Pythagorean problem based on the idea that mathematical structures are the result of applying an abstraction principle on physical quantitative structures. In particular, I propose the view that abstraction may be seen as the operation of structure determination which transforms concrete physical quantities (i.e. undetermined structures) into abstract mathematical quantities (fully determined structures of thin and shallow objects). (shrink)

This paper clarifies Merleau-Ponty’s original account of “higher-order” cognition as fundamentally embodied and enacted. Merleau-Ponty’s philosophy inspired theories that deemphasize overlaps between conceptual knowledge and motor intentionality or, on the contrary, focus exclusively on abstract thought. In contrast, this paper explores the link between Merleau-Ponty’s account of motor intentionality and his interpretations of our capacity to understand and interact productively with cultural symbolic systems. I develop my interpretation based on Merleau-Ponty’s analysis of two neuropathological modifications of motor intentionality, the (...) case of the brain-injured war veteran Schneider, and a neurological disorder known as Gerstmann’s syndrome. Building on my analysis of Schneider’s sensorimotor compensatory performances in relation to his limitations in the domains of algebra, geometry, and language usage, I demonstrate a strong continuity between the sense of embodiment and enaction at all these levels. Based on Merleau-Ponty’s interpretations, I argue that “higher-order” cognition is impaired in Schneider insofar as his injury limits his sensorimotor capacity to dynamically produce comparatively more complex differentiations of any given phenomenal structure. I then show how Merleau-Ponty develops and specifies his interpretation of Schneider’s intellectual difficulties in relation to the ambiguous role of the body, and in particular the hand, in Gerstmann’s syndrome. I explain how Merleau-Ponty defends the idea that sensorimotor and quasi-representational cognition are mutually irreducible, while maintaining that symbol-based cognition is a fundamentally enactive and embodied process. (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)

Andr ́e Weil viewed mathematics as deeply intertwined with metaphysics. In his essay ”From Metaphysics to Mathematics,” he illustrates how mathematical ideas often arise from vague, metaphysical analogies and reflections that guide researchers toward new theories. For instance, Weil discusses how analogies between different areas, such as number theory and algebraic functions, have led to significant breakthroughs. These metaphysical underpinnings provide a fertile ground for mathematical creativity, eventually transforming into rigorous mathematical structures. -/- Alexander Grothendieck’s work, particularly in ”R ́ecoltes (...) et Semailles,” resonates with Weil’s ideas by emphasizing the organic and generative aspects of mathematical creation. Grothendieck sees mathematical work as akin to cultivating a garden, where ideas grow and develop in a nurturing environment. He describes the process of mathematical discovery as a deeply personal and creative journey, involving both solitary reflection and collaborative effort. -/- Grothendieck’s concept of creating mathematical ”houses” aligns with his broader philosophical view that mathematics provides structures within which new ideas can flourish. His work in category theory and algebraic geometry exemplifies this approach, where he developed vast, interconnected frameworks that have become foundational in modern mathematics. Grothendieck’s analogy of constructing houses for others to live in highlights the mathematician’s role in creating abstract frameworks that others can inhabit and explore. This metaphor emphasizes the constructive nature of mathematics, where researchers build theoretical structures that form the basis for further exploration and application by the mathematical community. (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)

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)

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 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)

From The Cone of Perception, volume one of my collected works, you will remember that one of the main topics in that work was V-Curvature, also called, "phenomenological velocity." In that work, although a solution to the v - curvature variable was provided as well as many graphs that yielded numerous jewels of spiral formulations in exquisite 3D color formations, that method by which the solution was found was not iterated. This chapter begins by showing how it is possible to (...) solve for something that ideally ought cancel out with itself and how, although commutation between square roots is valid, there may be room here for an alternate route of accessing a hidden dimension - that dimension we call V-Curvature, or, "Phenomenological Velocity." Herein is provided the pathway for solving for V-Curvature in terms of Csc, which can be translated into Sin and Cos functionality. Furthermore, the processing these equations through WolframAlpha yielded other insights into limits, roots, and series that logically follow. How did the solutions to the, "velocity," v - variable curvature in the Lorentz coefficient, "manifest," when the Lorentz coefficient ought cancel out with itself? The step - by - step solution below illustrates the algebraic process by which a specific solution for something that ought cancel out with itself can be found. The Sphere of Realization is a groundbreaking work of philosophical and mathematical theory. The first volume of this epic collection examines the concept of V-Curvature, or Phenomenological Velocity, using algebraic equations to explain how this phenomenon can be solved. This book goes on to explore the implications of these equations, such as limits, roots, series, and introspection into infinity, providing an alternate route for accessing a 'hidden dimension' that connects physical laws with abstract philosophical ideas. By utilizing this understanding, the author creates a platform for introspection into life and nature, and considers the philosophical implications of this perception, from the exploration of the infinity of angles to theions of time, velocity, the emergence of real numbers, and the meanings of eternity, forever, infinity, and never ending. This landmark work of mathematical exploration and philosophical discovery will challenge and expand our understanding of the universe, and invite us into a journey of introspection and understanding. An exploration of the esoteric terms therein, and the pathways they provide to access new modes of thought, will give the reader the ability to gain a greater insight into the intricacies of reality. The Sphere of Realization provides a unique and comprehensive approach to a difficult concept. Through a blend of philosophical and mathematical exploration, the author delves into the concept of V-Curvature, or Phenomenological Velocity to unlock the mysteries of "hidden dimensions" within our reality. These equations and theories allow the reader to explore angles, time, velocity, roots, series, and other related concepts. In so doing, the book offers an exciting journey into the esoteric. The author also provides insights into the emergence of real numbers from infinity, introducing concepts such as eternity, forever, and never ending in the process. A comprehensive discussion of the applicable equations and transformations, immune to the construct of time, serves as a powerful tool for unlocking a meaningful understanding of the universe. The Sphere of Realization is an opportunity to gain a deeper appreciation of the reality of our world. (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)

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)

Much problem solving and learning research in math and science has focused on formal representations. Recently researchers have documented the use of unschooled strategies for solving daily problems -- informal strategies which can be as effective, and sometimes as sophisticated, as school-taught formalisms. Our research focuses on how formal and informal strategies interact in the process of doing and learning mathematics. We found that combining informal and formal strategies is more effective than single strategies. We provide a theoretical account of (...) this multiple strategy effect and have begun to formulate this theory in an ACT-R computer model. We show why students may reach common impasses in the use of written algebra, and how subsequent or concurrent use of informal strategies leads to better problem-solving performance. Formal strategies facilitate computation because of their abstract and syntactic nature; however, abstraction can lead to nonsensical interpretations and conceptual errors. Reapplying the formal strategy will not repair such errors; switching to an informal one may. We explain the multiple strategy effect as a complementary relationship between the computational efficiency of formal strategies and the sense-making function of informal strategies. (shrink)

In their seeking of simplicity, scientists fall into the error of Whitehead's "fallacy of misplaced concreteness." They mistake their abstract concepts describing reality for reality itself--the map for the territory. This leads to dogmatic overstatements, paradoxes, and mysteries such as the deep incompatibility of our two most fundamental physical theories--quantum mechanics and general relativity. To avoid such errors, we should evoke Whitehead's conception of the universe as a universe-in-process, where physical relations perpetually beget new physical relations. Today, the most (...) promising interpretations of quantum mechanics exemplify this Whiteheadian idea, formalizing physical systems, and the universe itself, as ongoing histories of actualizations of potential states, where actual states and potential states exist in mutually implicative relation as two separate categories of reality—an idea first proposed by Aristotle and rehabilitated by Heisenberg. In these interpretations, the classical conception of a history as a derivative story about fundamental physical objects is reversed: the classical physical object becomes the derivative story about fundamental histories of quantum states. The consistent histories interpretation of Robert Griffiths and the decoherent histories interpretation of Roland Omnès are cardinal examples of this approach to quantum mechanics. Another example, the relational realist interpretation, begins with the decoherent histories approach and formalizes it explicitly as a Whiteheadian interpretation, taking his “algebraic method” and applying it to quantum mechanics via algebraic topology. This branch of mathematics can be thought of as a “de-concretized” geometry in that it focuses only on the logical relations among objects and regions (and relations of these relations) rather than the fixed magnitudes of lines, planes, and other such rigid intervals. It has all the robust logical structure of geometry yet allows for an elasticity of relations that makes topological mathematical structures inherently immune misplaced concretization. (shrink)

We develop a Priestley-style duality theory for different classes of algebras having a bilattice reduct. A similar investigation has already been realized by B. Mobasher, D. Pigozzi, G. Slutzki and G. Voutsadakis, but only from an abstract category-theoretic point of view. In the present work we are instead interested in a concrete study of the topological spaces that correspond to bilattices and some related algebras that are obtained through expansions of the algebraic language.

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)

The mathematical developments of the 19th century seemed to undermine Kant’s philosophy. Non-Euclidean geometries challenged Kant’s view that there is a spatial intuition rich enough to yield the truth of Euclidean geometry. Similarly, advancements in algebra challenged the view that temporal intuition provides a foundation for both it and arithmetic. Mathematics seemed increasingly detached from experience as well as its form; moreover, with advances in symbolic logic, mathematical inference also seemed independent of intuition. This paper considers various philosophical responses (...) to these changes, focusing on the idea of modifying Kant’s conception of intuition in order to accommodate the increasing abstractness of mathematics. It is argued that far from clinging to an outdated paradigm, programs based on new conceptions of intuition should be seen as motivated by important philosophical desiderata, such as the truth, apriority, distinctiveness and autonomy of mathematics. (shrink)

In the Critique of Pure Reason, Kant defends the mathematically deterministic world of physics by arguing that its essential features arise necessarily from innate forms of intuition and rules of understanding through combinatory acts of imagination. Knowing is active: it constructs the unity of nature by combining appearances in certain mandatory ways. What is mandated is that sensible awareness provide objects that conform to the structure of ostensive judgment: “This (S) is P.” -/- Sensibility alone provides no such objects, so (...) the imagination compensates by combining passing point-data into “pure” referents for the subject-position, predicate-position, and copula. The result is a cognitive encounter with a generic physical object whose characteristics—magnitude, substance, property, quality, and causality—are abstracted as the Kantian categories. Each characteristic is a product of “sensible synthesis” that has been “determined” by a “function of unity” in judgment. -/- Understanding the possibility of such determination by judgment is the chief difficulty for any rehabilitative reconstruction of Kant’s theory. I will show that Kant conceives of figurative synthesis as an act of line-drawing, and of the functions of unity as rules for attending to this act. The subject-position refers to substance, identified as the objective time-continuum; the predicate-position, to quality, identified as the continuum of property values (constituting the second-order type named by the predicate concept). The upshot is that both positions refer to continuous magnitudes, related so that one (time-value) is the condition of the other (property-value). -/- Kant’s theory of physically constructive grammar is thus equivalent to the analytic-geometric formalism at work in the practice of mathematical physics, which schematizes time and state as lines related by an algebraic formula. Kant theorizes the subject–predicate relation in ostensive judgment as an algebraic time–state function. When aimed towards sensibility, “S is P” functions as the algebraic relation “t → ƒ(t).”. (shrink)

Many results in logic and mathematics rely on techniques that allow for concrete, often visual, representations of abstract concepts. A primary example of this phenomenon in logic is the distinction between syntax and semantics, itself an example of the more general duality in mathematics between algebra and geometry. Such representations, however, often rely on the existence of certain maximal objects having particular properties such as points, possible worlds or Tarskian first-order structures. -/- This dissertation explores an alternative to (...) such representations known as possibility semantics. Its core idea is to replace maximal objects with ordered systems of partial approximations. Although it originates in the semantics of modal logic and the representation of abstract ordered structures, I argue that it has far-reaching mathematical, foundational and philosophical significance, especially in the context of semiconstructive mathematics, a foundational framework that does not assume any fragment of the Axiom of Choice beyond the Axiom of Dependent Choices. -/- The dissertation is divided in two main parts. The first part explores various applications of the mathematical framework underlying possibility semantics to lattice theory and non-classical propositional logics. A major theme is the development of constructive dualities for various categories of lattices, which are related to standard non-constructive dualities via Vietoris constructions. -/- The second part of the dissertation explores the alternative foundational setting of semi-constructive mathematics, focusing on three applications of possibility semantics for classical first-order logic to the philosophy of the mathematical infinite. In particular, we introduce generic powers, a semi-constructive analogue of ultrapowers in classical model theory, and we explore the merits of these structures from a foundational, conceptual and historical viewpoint. (shrink)

We present a set-theoretic model of the mental representation of classically quantified sentences (All P are Q, Some P are Q, Some P are not Q, and No P are Q). We take inclusion, exclusion, and their negations to be primitive concepts. It is shown that, although these sentences are known to have a diagrammatic expression (in the form of the Gergonne circles) which constitute a semantic representation, these concepts can also be expressed syntactically in the form of algebraic formulas. (...) It is hypothesized that the quantified sentences have an abstract underlying representation common to the formulas and their associated sets of diagrams (models). Nine predictions are derived (three semantic, two pragmatic, and four mixed) regarding people's assessment of how well each of the five diagrams expresses the meaning of each of the quantified sentences. The results from three experiments, using Gergonne's circles or an adaptation of Leibniz lines as external representations, are reported and shown to support the predictions. (shrink)

The quest to understand the natural and the mathematical as well as philosophical principles of dynamics of life forms are ancient in the human history of science. In ancient times, Pythagoras and Plato, and later, Copernicus and Galileo, correctly observed that the grand book of nature is written in the language of mathematics. Platonism, Aristotelian logism, neo-realism, monadism of Leibniz, Hegelian idealism and others have made efforts to understand reasons of existence of life forms in nature and the underlying principles (...) through the lenses of philosophy and mathematics. In this paper, an approach is made to treat the similar question about nature and existential life forms in view of mathematical philosophy. The approach follows constructivism to formulate an abstract model to understand existential life forms in nature and its dynamics by selectively combining the elements of various schools of thoughts. The formalisms of predicate logic, probabilistic inference and homotopy theory of algebraic topology are employed to construct a structure in local time-scale horizon and in cosmological time-scale horizon. It aims to resolve the relative and apparent conflicts present in various thoughts in the process, and it has made an effort to establish a logically coherent interpretation. (shrink)

A model of consciousness and conscious experience is introduced. Starting with a non-Lipschitz Chaotic dynamics of neural activity, we propose that the synaptic transmission between adjacent as well as distant neurons should be regulated in brain dynamics through quantum tunneling. Further, based on various studies of different previous authors, we consider the emergence of very large quantum mechanical system representable by an abstract quantum net entirely based on quantum-like entities having in particular the important feature of expressing self-reference similar (...) to what occurs in consciousness. The properties of such quantum-like mind entities are discussed in detail. A quantum-like model of conscious experience is also discussed. It is shown that such quantum mechanical entities are able to arrange themselves alternatively on the basis of the subject story, memory, and pain-pleasure in response to an external stimulus, thus giving the subject the possibility to response to the stimulus on the basis of his emotion as well as cognitive state. Finally, we discuss the possible connections between the quantum-like model introduced in this paper and the chaotic behaviors often identified experimentally in studies on brain dynamics. Part I of this article contains: Introduction; 1. Non Lipschitz Terminal Dynamics of Single Neuron Activity; and References; 2. Quantum Mechanical Properties of Neuron Dynamics; and 3. A Quantum Model of Consciousness I. (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)

This paper investigates a generalization of Boolean algebras which I call agglomerative algebras. It also outlines two conceptions of propositions according to which they form an agglomerative algebra but not a Boolean algebra with respect to conjunction and negation.

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.