Algebra

En este trabajo matemático-filosófico se estudian cuatro tópicos de la Lógica matemática: El método de construcción de modelos llamado Ultraproductos, la Propiedad de Interpolación de Craig, las Álgebras booleanas y los Órdenes parciales separativos. El objetivo principal del mismo es analizar la importancia que tienen dichos tópicos para el estudio de los fundamentos de la matemática, desde el punto de vista del platonismo matemático. Para cumplir con tal objetivo se trabajará en el ámbito de la Matemática, de la Metamatemática y (...) de la Filosofía de la matemática. El desarrollo de la investigación arrojó como resultado que tales tópicos son muy importantes para el estudio de los fundamentos de la matemática, desde el punto de vista del platonismo matemático, y en el trabajo se explica detalladamente con abundantes ejemplos el porqué (al final de cada sección y al final del mismo). (shrink)

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...) economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (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)

We investigate the algebraic structures of square grid graphs and obtain isomorphism theorems.

Mathematical diagrams are frequently used in contemporary mathematics. They are, however, widely seen as not contributing to the justificatory force of proofs: they are considered to be either mere illustrations or shorthand for non-diagrammatic expressions. Moreover, when they are used inferentially, they are seen as threatening the reliability of proofs. In this paper, I examine certain examples of diagrams that resist this type of dismissive characterization. By presenting two diagrammatic proofs, one from topology and one from algebra, I show that (...) diagrams form genuine notational systems, and I argue that this explains why they can play a role in the inferential structure of proofs without undermining their reliability. I then consider whether diagrams can be essential to the proofs in which they appear. (shrink)

In this article, I consider the positive logic of Boolean groups (i.e. Abelian groups where every non-identity element has order 2), where these are taken as frames for an operational semantics à la Urquhart. I call this logic BG. It is shown that the logic over the smallest nontrivial Boolean group, taken as a frame, is identical to the positive fragment of a quasi-relevance logic that was developed by Robles and Méndez (an extension of this result where negation is included (...) is also discussed). It is proved that BG satisfies the variable sharing property and is Halldén complete, while failing to satisfy the disjunction property. Sound and complete subscripted tableaux are presented for BG. An axiomatization (in the positive language extended with fusion) is presented, which is sound with respect to BG and, with respect to a related ternary relational semantics, complete; the problem of identifying a complete axiomatization for BG itself is left open. Connections between BG and the quasi-relevance logic KR are also discussed. (shrink)

This book is dedicated to V.A. Yankov’s seminal contributions to the theory of propositional logics. His papers, published in the 1960s, are highly cited even today. The Yankov characteristic formulas have become a very useful tool in propositional, modal and algebraic logic. The papers contributed to this book provide the new results on different generalizations and applications of characteristic formulas in propositional, modal and algebraic logics. In particular, an exposition of Yankov’s results and their applications in algebraic logic, the theory (...) of admissible rules and refutation systems is included in the book. In addition, the reader can find the studies on splitting and join-splitting in intermediate propositional logics that are based on Yankov-type formulas which are closely related to canonical formulas, and the study of properties of predicate extensions of non-classical propositional logics. The book also contains an exposition of Yankov’s revolutionary approach to constructive proof theory. The editors also include Yankov’s contributions to history and philosophy of mathematics and foundations of mathematics, as well as an examination of his original interpretation of history of Greek philosophy and mathematics. (shrink)

In this article, we first provide a modified definition of SuperHyperGraphs (SHG) and we call it Restricted SuperHyperGraphs (R-SHG). We then generalize the R-SHG to the neutrosophic graphs and then define the corresponding trees. In the following, we examine the Helly property for subtrees of SuperHyperGraphs.

This paper provides a definitive answer, based on considerations derived from first-order logic, to the question regarding the status of elementary geometry, whether elementary geometry can be reduced to algebra. The answer we arrive at is negative, and is based on a series of structural questions that can be asked only inside the geometric formal theory, as well as the consideration of reverse geometry, which is the art of finding minimal axiom systems strong enough to prove certain geometrical theorems, given (...) that there are no algebraic structures that one could associate with those minimal axiom systems. (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 paper we recall our concepts of n th-Power Set of a Set, SuperHyperOperation, SuperHyperAxiom, SuperHyperAlgebra, and their corresponding Neutrosophic SuperHyperOperation, Neutrosophic SuperHyperAxiom and Neutrosophic SuperHyperAlgebra. In general, in any field of knowledge, one actually encounters SuperHyperStructures (or more accurately (m, n)- SuperHyperStructures).

In this paper, one recalls the general definition of the SuperHyperAlgebra with its SuperHyperOperations and SuperHyperAxioms [2, 6]. Then one introduces for the first time the SuperHyperTopology and especially the SuperHyperFunction and Neutrosophic SuperHyperFunction. One gives a numerical example of a Neutro-SuperHyperGroup.

Neutrosophy, the study of neutralities, is a new branch of Philosophy that has applications in many different fields of science. Inspired by the idea of Neutrosophy, Smarandache introduced NeutroAlgebraicStructures (or NeutroAlgebras) by allowing the partiality and indeterminacy to be included in the structures’ operations and/or axioms.

Starting with a partial order on a NeutroAlgebra, we get a NeutroStructure. The latter if it satisfies the conditions of NeutroOrder, it becomes a NeutroOrderedAlgebra. In this paper, we apply our new defined notion to semigroups by studying NeutroOrderedSemigroups. More precisely, we define some related terms like NeutrosOrderedSemigroup, NeutroOrderedIdeal, NeutroOrderedFilter, NeutroOrderedHomomorphism, etc., illustrate them via some examples, and study some of their properties.

We study when the property that a field is dense in its real and p-adic closures is elementary in the language of rings and deduce that all models of the theory of algebraic fields have this property.

This paper aims to develop an elegant formula for the series of consecutive cubes of natural numbers under alternating signs. In addition, this paper investigates the formula under odd and even number of terms and discuss some important findings.

This paper aims to construct a new formula that generates a generalized version of congruent numbers based on a generalized version of Pythagorean triples. Here, an elliptic curve equation is constructed from the derived generalized version of Pythagorean triples and congruent numbers and gives some new results.

This paper argues that Noether's axiomatic method in algebra cannot be assimilated to Weyl's late view on axiomatics, for his acquiescence to a phenomenological epistemology of correctness led Weyl to resist Noether's principle of detachment.

The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a Boolean (...) algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras. (shrink)

This article investigates religious ideals persistent in the datafication of information society. Its nodal point is Thomas Bayes, after whom Laplace names the primal probability algorithm. It reconsiders their mathematical innovations with Laplace's providential deism and Bayes' singular theological treatise. Conceptions of divine justice one finds among probability theorists play no small part in the algorithmic data-mining and microtargeting of Cambridge Analytica. Theological traces within mathematical computation are emphasized as the vantage over large numbers shifts to weights beyond enumeration in (...) probability theory. Collateral secularizations of predestination and theodicy emerge as probability optimizes into Bayesian prediction and machine learning. The paper revisits the semiotics and theism of Peirce and a given beyond the probable in Whitehead to recontextualize the critiques of providence by Agamben and Foucault. It reconsiders datafication problems alongside Nietzschean valuations. Religiosity likely remains encoded within the very algorithms presumed purified by technoscientific secularity or mathematical dispassion. (shrink)

An Elementary Transition to Abstract Mathematics will help students move from introductory courses to those where rigor and proof play a much greater role. The text is organized into five basic parts: the first looks back on selected topics from pre-calculus and calculus, treating them more rigorously, and it covers various proof techniques; the second part covers induction, sets, functions, cardinality, complex numbers, permutations, and matrices; the third part introduces basic number theory including applications to cryptography; the fourth part introduces (...) key objects from abstract algebra; and the final part focuses on polynomials. Features: The material is presented in many short chapters, so that one concept at a time can be absorbed by the student. Two "looking back" chapters at the outset (pre-calculus and calculus) are designed to start the student's transition by working with familiar concepts. Many examples of every concept are given to make the material as concrete as possible and to emphasize the importance of searching for patterns. A conversational writing style is employed throughout in an effort to encourage active learning on the part of the student. (shrink)

We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional valuations ranging over only the ¬¬-fixpoints of the algebra. We show how inquisitive algebras arise from Boolean algebras: for a given Boolean algebra B, we define its inquisitive extension H(B) and prove that H(B) is the unique inquisitive algebra having B as its algebra of ¬¬-fixpoints. We also show that inquisitive algebras determine Medvedev’s logic (...) of finite problems. In addition to the algebraic characterization of H(B), we give a topological characterization of H(B) in terms of the recently introduced choice-free duality for Boolean algebras using so-called upper Vietoris spaces (UV-spaces). In particular, while a Boolean algebra B is realized as the Boolean algebra of compact regular open elements of a UV-space dual to B, we show that H(B) is realized as the algebra of compact open elements of this space. This connection yields a new topological semantics for inquisitive logic. (shrink)

Transition to Real Analysis with Proof provides undergraduate students with an introduction to analysis including an introduction to proof. The text combines the topics covered in a transition course to lead into a first course on analysis. This combined approach allows instructors to teach a single course where two were offered. The text opens with an introduction to basic logic and set theory, setting students up to succeed in the study of analysis. Each section is followed by graduated exercises that (...) both guide and challenge students. The author includes examples and illustrations that appeal to the visual side of analysis. The accessible structure of the book makes it an ideal refence for later years of study or professional work. (shrink)

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)

Essay Review of “Les Arithmétiques de Diophante. Lecture historique et mathématique” by Roshdi Rashed and Christian Houzel, and Histoire de l’analyse diophantienne classique : d’Abū Kamil à Fermat by Roshdi Rashed.

The aim of this article is to investigate the roles of commutative diagrams (CDs) in a specific mathematical domain, and to unveil the reasons underlying their effectiveness as a mathematical notation; this will be done through a case study. It will be shown that CDs do not depict spatial relations, but represent mathematical structures. CDs will be interpreted as a hybrid notation that goes beyond the traditional bipartition of mathematical representations into diagrammatic and linguistic. It will be argued that one (...) of the reasons why CDs form a good notation is that they are highly mathematically tractable: experts can obtain valid results by ‘calculating’ with CDs. These calculations, take the form of ‘diagram chases’. In order to draw inferences, experts move algebraic elements around the diagrams. It will be argued that these diagrams are dynamic. It is thanks to their dynamicity that CDs can externalize the relevant reasoning and allow experts to draw conclusions directly by manipulating them. Lastly, it will be shown that CDs play essential roles in the context of proof as well as in other phases of the mathematical enterprise, such as discovery and conjecture formation. (shrink)

El objetivo de este artículo es presentar una demostración de un teorema clásico sobre álgebras booleanas y ordenes parciales de relevancia actual en teoría de conjuntos, como por ejemplo, para aplicaciones del método de construcción de modelos llamado “forcing” (con álgebras booleanas completas o con órdenes parciales). El teorema que se prueba es el siguiente: “Todo orden parcial se puede extender a una única álgebra booleana completa (salvo isomorfismo)”. Donde extender significa “sumergir densamente”. Tal demostración se realiza utilizando cortaduras de (...) Dedekind siguiendo el texto “Set Theory” de Jech, y otras ideas propias del autor de este artículo. Adicionalmente, se formulan algunas versiones débiles del axioma de elección relacionadas con las álgebras booleanas, las cuales son también de gran importancia para la investigación en teoría de conjuntos y teoría de modelos, pues estas son poderosas técnicas de construcción de modelos, como por ejemplo, el teorema de compacidad (permite construir modelos no estándar, etc) y el teorema del ultrafiltro, que permite construir ultraproductos (pueden ser usados para investigar problemas de cardinales grandes, etc). Se presentan algunas referencias de problemas abiertos sobre el tema. -/- The objective of this paper is to present a demonstration of a classical theorem on boolean algebras and partial orders of current relevance in set theory, as for example, for applications of model construction method called forcing" (with boolean algebras complete or with partial orders). The theorem to be proved is as follows: Any partial order can be extended to a single complete boolean algebra (up to isomorphism)". Where to extend means embed densely". Such a demonstration is done using Dedekind's cuts following the text Set Theory" of Jech, and other ideas of the author of this article. In addition, some weak versions of the axiom of choice related to boolean algebras are formulated, which are also of great importance for the research in set theory and model theory, since this are powerful model construction techniques, such as the compactness theorem (allows the construction of non-standard models, etc.) and the ultralter theorem, which allows the construction of ultraproducts (can be used to investigate problems of large cardinals, etc). Some references of open problems on the subject are presented. (shrink)

The paper is an introduction to geometric algebra and geometric calculus for those with a knowledge of undergraduate mathematics. No knowledge of physics is required. The section Further Study lists many papers available on the web.

A mathematical matrix is usually defined as a two-dimensional array of scalars. And yet, as I explain, matrices are not in fact two-dimensional arrays. So are we to conclude that matrices do not exist? I show how to resolve the puzzle, for both contemporary and older mathematics. The solution generalises to the interpretation of all mathematical discourse. The paper as a whole attempts to reinforce mathematical structuralism by reflecting on how best to interpret mathematics.

We generalize the double negation construction of Boolean algebras in Heyting algebras to a double negation construction of the same in Visser algebras. This result allows us to generalize Glivenko’s theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras.

This article will consider imagination in mathematics from a historical point of view, noting the key moments in its conception during the ancient, modern and contemporary eras.

A graduate-level introduction to finite classical groups featuring a comprehensive account of the conjugacy and geometry of elements of prime order.

This volume contains the proceedings of three special sessions: Algebra and Computer Science, held during the Joint AMS-EMS-SPM meeting in Porto, Portugal, June 10–13, 2015; Groups, Algorithms, and Cryptography, held during the Joint Mathematics Meeting in San Antonio, TX, January 10–13, 2015; and Applications of Algebra to Cryptography, held during the Joint AMS-Israel Mathematical Union meeting in Tel-Aviv, Israel, June 16–19, 2014. Papers contained in this volume address a wide range of topics, from theoretical aspects of algebra, namely group theory, (...) universal algebra and related areas, to applications in several different areas of computer science. From the computational side, the book aims to reflect the rapidly emerging area of algorithmic problems in algebra, their computational complexity and applications, including information security, constraint satisfaction problems, and decision theory. The book gives special attention to recent advances in quantum computing that highlight the need for a variety of new intractability assumptions and have resulted in a new area called group-based cryptography. (shrink)

In this book the notion of semigroups under + is constructed using: the MOD natural neutrosophic integers, or MOD natural neutrosophic-neutrosophic numbers, or MOD natural neutrosophic finite complex modulo integer, or MOD natural neutrosophic dual number integers, or MOD natural neutrosophic special dual like number, or MOD natural neutrosophic special quasi dual numbers.

Real-world information is imperfect and is usually described in natural language (NL). Moreover, this information is often partially reliable and a degree of reliability is also expressed in NL. In view of this, the concept of a Z-number is a more adequate concept for the description of real-world information. The main critical problem that naturally arises in processing Z-numbers-based information is the computation with Z-numbers. Nowadays, there is no arithmetic of Z-numbers suggested in existing literature. This book is the first (...) to present a comprehensive and self-contained theory of Z-arithmetic and its applications. Many of the concepts and techniques described in the book, with carefully worked-out examples, are original and appear in the literature for the first time. The book will be helpful for professionals, academics, managers and graduate students in fuzzy logic, decision sciences, artificial intelligence, mathematical economics, and computational economics. (shrink)

We identify the \-ideals of a distributive demi-pseudocomplemented algebra L as the kernels of the boolean congruences on L, and show that they form a complete Heyting algebra which is isomorphic to the interval \ of the congruence lattice of L where G is the Glivenko congruence. We also show that the notions of maximal \-ideal, prime \-ideal, and falsity ideal coincide.