In this paper we study some questions concerning Łukasiewicz implication algebras. In particular, we show that every subquasivariety of Łukasiewicz implication algebras is, in fact, a variety. We also derive some characterizations of congruence permutable algebras. The starting point for these results is a representation of finite Łukasiewicz implication algebras as upwardly-closed subsets in direct products of MV-chains.

In this paper we study some questions concerning Łukasiewicz implication algebras. In particular, we show that every subquasivariety of Łukasiewicz implication algebras is, in fact, a variety. We also derive some characterizations of congruence permutable algebras. The starting point for these results is a representation of finite Łukasiewicz implication algebras as upwardly-closed subsets in direct products of MV-chains.

We discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed and essentially unique. Thus, we obtain the surprising result that on such sets, logic with three variables is as powerful in expression as full first order (...) logic. (shrink)

Using mathematical tools from number theory and finite fields, Applied Algebra: Codes, Ciphers, and Discrete Algorithms, Second Edition presents practical methods for solving problems in data security and data integrity. It is designed for an applied algebra course for students who have had prior classes in abstract or linear algebra. While the content has been reworked and improved, this edition continues to cover many algorithms that arise in cryptography and error-control codes. New to the Second Edition A (...) CD-ROM containing an interactive version of the book that is powered by Scientific Notebook®, a mathematical word processor and easy-to-use computer algebra system New appendix that reviews prerequisite topics in algebra and number theory Double the number of exercises Instead of a general study on finite groups, the book considers finite groups of permutations and develops just enough of the theory of finite fields to facilitate construction of the fields used for error-control codes and the Advanced Encryption Standard. It also deals with integers and polynomials. Explaining the mathematics as needed, this text thoroughly explores how mathematical techniques can be used to solve practical problems. About the Authors Darel W. Hardy is Professor Emeritus in the Department of Mathematics at Colorado State University. His research interests include applied algebra and semigroups. Fred Richman is a professor in the Department of Mathematical Sciences at Florida Atlantic University. His research interests include Abelian group theory and constructive mathematics. Carol L. Walker is Associate Dean Emeritus in the Department of Mathematical Sciences at New Mexico State University. Her research interests include Abelian group theory, applications of homological algebra and category theory, and the mathematics of fuzzy sets and fuzzy logic. (shrink)

In this paper we pursue the study of the variety of m -generalized Łukasiewicz algebras of order n which was initiated in [1]. This variety contains the variety of Łukasiewicz algebras of order n . Given , we establish an isomorphism from its congruence lattice to the lattice of Stone filters of a certain Łukasiewicz algebra of order n and for each congruence on A we find a description via the corresponding Stone filter. We characterize the principal congruences on (...) A via Stone filters. In doing so, we obtain a polynomial equation which defines the principal congruences on the algebras of . After showing that for m > 1 and n > 2, the variety of Łukasiewicz algebras of order n is a proper subvariety of , we prove that is a finitely generated discriminator variety and point out some consequences of this strong property, one of which is congruence permutability. (shrink)

This brief article is intended to introduce the reader to the field of algebraic set theory, in which models of set theory of a new and fascinating kind are determined algebraically. The method is quite robust, applying to various classical, intuitionistic, and constructive set theories. Under this scheme some familiar set theoretic properties are related to algebraic ones, while others result from logical constraints. Conventional elementary set theories are complete with respect to algebraic models, which arise in a variety of (...) ways, including topologically, type-theoretically, and through variation. Many previous results from topos theory involving realizability, permutation, and sheaf models of set theory are subsumed, and the prospects for further such unification seem bright. (shrink)

It is a long standing open problem whether or not the Axiom of Countable Choice implies the fragment of Martin's Axiom either in or in. In this direction, we provide a partial answer by establishing that the Boolean Prime Ideal Theorem in conjunction with the Countable Union Theorem does not imply restricted to complete Boolean algebras in. Furthermore, we prove that the latter (formally) weaker form of and the Δ‐system Lemma are independent of each other in.We also answer open questions (...) from Tachtsis [16] which concern the status of restricted to complete Boolean algebras in certain Fraenkel–Mostowski permutation models of and we strengthen some results from the above paper. (shrink)

We study finitely generated free Heyting algebras from a topological and from a model theoretic point of view. We review Bellissima’s representation of the finitely generated free Heyting algebra; we prove that it yields an embedding in the profinite completion, which is also the completion with respect to a naturally defined metric. We give an algebraic interpretation of the Kripke model used by Bellissima as the principal ideal spectrum and show it to be first order interpretable in the Heyting (...) algebra, from which several model theoretic and algebraic properties are derived. In particular, we prove that a free finitely generated Heyting algebra has only one set of free generators, which is definable in it. As a consequence its automorphism group is the permutation group over its generators. (shrink)

This paper proposes to present a novel method of generating cryptographic dynamic substitution-boxes, which makes use of the combined effect of discrete hyperchaos mapping and algebraic group theory. Firstly, an improved 2D hyperchaotic map is proposed, which consists of better dynamical behaviour in terms of large Lyapunov exponents, excellent bifurcation, phase attractor, high entropy, and unpredictability. Secondly, a hyperchaotic key-dependent substitution-box generation process is designed, which is based on the bijectivity-preserving effect of multiplication with permutation matrix to obtain satisfactory configuration (...) of substitution-box matrix over the enormously large problem space of 256!. Lastly, the security strength of obtained S-box is further elevated through the action of proposed algebraic group structure. The standard set of performance parameters such as nonlinearity, strict avalanche criterion, bits independent criterion, differential uniformity, and linear approximation probability is quantified to assess the security and robustness of proposed S-box. The simulation and comparison results demonstrate the effectiveness of proposed method for the construction of cryptographically sound S-boxes. (shrink)

Given an admissible indexing φ of the countable atomless Boolean algebra B, an automorphism F of B is said to be recursively presented (relative to φ) if there exists a recursive function $p \in \operatorname{Sym}(\omega)$ such that F ⚬ φ = φ ⚬ p. Our key result on recursiveness: Both the subset of $\operatorname{Aut}(\mathscr{B})$ consisting of all those automorphisms which are recursively presented relative to some indexing, and its complement, the set of all "totally nonrecursive" automorphisms, are uncountable. This (...) arises as a consequence of the following combinatorial investigations: (1) A comparison of the cycle structures of f and f̄, where f is a permutation of some free basis of B and f̄ is the automorphism of B induced by f. (2) An explicit description of the permutations of ω whose conjugacy classes in $\operatorname{Sym}(\omega)$ are (a) uncountable, (b) countably infinite, and (c) finite. (shrink)

In this paper we investigate the computational complexity of deciding if the variety generated by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be specified using a certain kind of finite labelled path. This class of Maltsev conditions includes several well known conditions, such as congruence permutability and having a sequence of n Jónsson terms, for some given n. We show that for such “path defined” Maltsev conditions, the decision problem is polynomial-time solvable.

One of the traditional ways mathematical ideas and even new areas of mathematics are created is from experiments. One of the best-known examples is that of the Fermat hypothesis, which was conjectured by Fermat in his attempts to find integer solutions for the famous Fermat equation. This hypothesis led to the creation of a whole field of knowledge, but it was proved only after several hundred years. This book, based on the author's lectures, presents several new directions of mathematical research. (...) All of these directions are based on numerical experiments conducted by the author, which led to new hypotheses that currently remain open, i.e., are neither proved nor disproved. The hypotheses range from geometry and topology (statistics of plane curves and smooth functions) to combinatorics (combinatorial complexity and random permutations) to algebra and number theory (continuous fractions and Galois groups). For each subject, the author describes the problem and presents numerical results that led him to a particular conjecture. In the majority of cases there is an indication of how the readers can approach the formulated conjectures (at least by conducting more numerical experiments). Written in Arnold's unique style, the book is intended for a wide range of mathematicians, from high school students interested in exploring unusual areas of mathematics on their own, to college and graduate students, to researchers interested in gaining a new, somewhat nontraditional perspective on doing mathematics. In the interest of fostering a greater awareness and appreciation of mathematics and its connections to other disciplines and everyday life, MSRI and the AMS are publishing books in the Mathematical Circles Library series as a service to young people, their parents and teachers, and the mathematics profession. Titles in this series are co-published with the Mathematical Sciences Research Institute (MSRI). (shrink)

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of equality. It turns out that there exists a continum of such reducts. Equivalently, expressed in the language of universal algebra, we classify those locally closed clones over a countable domain which contain all permutations of the domain.

We investigate in an algebraic setting the question of which logical languages can express the properties integral, permutational, and rigid for algebras of relations.

LetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$ to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.

The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar inequalities exist in algebras of multi-valued logic when the multiplication and addition operations are replaced with various T-norms and T-conorms respectively. For instance, we show that the rearrangement inequality holds when the T-norms and T-conorms are derived from Archimedean copulas.

The thesis pseudofinite structures and counting dimensions is about the model theory of pseudofinite structures with the focus on groups and fields. The aim is to deepen our understanding of how pseudofinite counting dimensions can interact with the algebraic properties of underlying structures and how we could classify certain classes of structures according to their counting dimensions. Our approach is by studying examples. We treat three classes of structures: The first one is the class of H-structures, which are generic expansions (...) of existing structures. We give an explicit construction of pseudofinite H-structures as ultraproducts of finite structures. The second one is the class of finite difference fields. We study properties of coarse pseudofinite dimension in this class, show that it is definable and integer-valued and build a partial connection between this dimension and transformal transcendence degree. The third example is the class of pseudofinite primitive permutation groups. We generalise Hrushovski’s classical classification theorem for stable permutation groups acting on a strongly minimal set to the case where there exists an abstract notion of dimension, which includes both the classical model theoretic ranks and pseudofinite counting dimensions. In this thesis, we also generalise Schlichting’s theorem for groups to the case of approximate subgroups with a notion of commensurability.prepared by Tingxiang Zou.E-mail: [email protected]: https://tel.archives-ouvertes.fr/tel-02283810/document. (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 consider various classes of algebras obtained by expanding idempotent semirings with meet, residuals and Kleene-*. An investigation of congruence properties (e-permutability, e-regularity, congruence distributivity) is followed by a section on algebraic Gentzen systems for proving inequalities in idempotent semirings, in residuated lattices, and in (residuated) Kleene lattices (with cut). Finally we define (one-sorted) residuated Kleene lattices with tests to complement two-sorted Kleene algebras with tests.

Written in a relaxed, readable style, A Concise Introduction to Pure Mathematics leads students gently but firmly into the world of higher mathematics. It provides beginning undergraduates with a rigourous grounding in the basic tools and techniques of the discipline and prepares them for further more advanced studies in analysis, differential equations, and algebra. This edition contains additional material on secret codes, permutations, and prime numbers. It features more than 200 exercises, with many completely new. The text is organized (...) into relatively independent chapters, allowing instructors to tailor the book to meet their individual course needs. · Contains extra material concerning prime numbers, forming the basis for data encryption · Explores "Secret Codes" - one of today's most spectacular applications of pure mathematics Discusses Permutations and their importance in many topics in discrete mathematics. (shrink)

En este trabaj o se propone establ ecerun pue n t e e n t r e e l e s t r uc t ur a l i s mofrancés desarrollado en Francia en losaños de 1960 y de 1970 en las cienciashumanas y sociales, y el estructuralismome t a t e ór i c o i na ugur a do por J os e phD. Sneed en 1971 como una extensiónde l pr ogr a ma de Bour ba (...) ki . Pa r a t a lefecto, se tomará como ‘puente’ el trabajoalgebraico realizado por el matemáticobourbaki ano André Wei l de l a t eorí ade Claude Lévi-Strauss sobre las estructuras elementalesdel parentesco. Interesa mostrar que Weilno sólo pretende mostrar que los modelosalgebraicos de permutación son un casode estructura elemental en el sentido deLévi-Strauss, sino que, gracias a dichaformalización, se provee al estructuralismofrancés de una noción matemática, nolingüística, de la noción de ‘estructura’en l a que se preci san al gunas de suspropiedades intuitivamente señaladaspor Lévi-Strauss. Si bien discutiremos-más allá de las pretensiones de Weil- silos sistemas de parentesco elementalesresultan adecuadamente representadospor l os model os de permut aci ón queintroduce Weil, i.e., si son modelos en elsentido estructuralista del término.In this paper, I intend to link the structuralismdeveloped in France between 1960and 1970 for the social and human scienceswith the metatheoric structuralism developedbyJosephD.Sneedin1971asanextensionofBourbaki’sprogram.Tothisend,Iwill consider as a ‘bridge’ the algebraicwork about Claude Lévi-Strauss’ theoryon the elementary structures of kinshipcompleted by the Bourbakian mathematicianAndré Weil. I intend to show thatWeil not only wants to demonstrate thatthe algebraic models of permutation are acase of elemental structure in the sense ofLévi-Strauss, but also, that thanks to thatformalization, French structuralism obtainsamathematicalnotionof“structure”inwhichsomeof its properties, intuitively identified byLévi-Strauss, are pined down. Furthermore,Iwilldiscuss–beyond the intentionsof Weil- whether elementary systems ofkinship are adequately represented bythe elementary models of permutationthat Weil introduces, i.e., whether they aremodels in the structuralist sense. (shrink)

For \(n\in \omega \), the weak choice principle \(\textrm{RC}_n\) is defined as follows: _For every infinite set_ _X_ _there is an infinite subset_ \(Y\subseteq X\) _with a choice function on_ \([Y]^n:=\{z\subseteq Y:|z|=n\}\). The choice principle \(\textrm{C}_n^-\) states the following: _For every infinite family of_ _n_-_element sets, there is an infinite subfamily_ \({\mathcal {G}}\subseteq {\mathcal {F}}\) _with a choice function._ The choice principles \(\textrm{LOC}_n^-\) and \(\textrm{WOC}_n^-\) are the same as \(\textrm{C}_n^-\), but we assume that the family \({\mathcal {F}}\) is linearly orderable (...) (for \(\textrm{LOC}_n^-\) ) or well-orderable (for \(\textrm{WOC}_n^-\) ). In the first part of this paper, for \(m,n\in \omega \) we will give a full characterization of when the implication \(\textrm{RC}_m\Rightarrow \textrm{WOC}_n^-\) holds in \({\textsf {ZF}}\). We will prove the independence results by using suitable Fraenkel-Mostowski permutation models. In the second part, we will show some generalizations. In particular, we will show that \(\textrm{RC}_5\Rightarrow \textrm{LOC}_5^-\) and that \(\textrm{RC}_6\Rightarrow \textrm{C}_3^-\), answering two open questions from Halbeisen and Tachtsis (Arch Math Logik 59(5):583–606, 2020). Furthermore, we will show that \(\textrm{RC}_6\Rightarrow \textrm{C}_9^-\) and that \(\textrm{RC}_7\Rightarrow \textrm{LOC}_7^-\). (shrink)

Three results in [14] and one in [8] are analyzed in Sections 3–6 in order to supply examples on Loeb probability spaces, which distinguish the different strength among three generalizations of k-saturation, as well to answer some questions in Section 7 of [15]. In Section 3 we show that not every automorphism of a Loeb algebra is induced by an internal permutation, in Section 4 we show that if the 1-special model axiom is true, then every automorphism of a (...) Loeb algebra is induced by a point-automorphism, in Section 5 we show that not every measure-preserving homomorphism from a small subalgebra to a Loeb algebra is induced by an internal permutation, without assuming full-saturation, in Section 6 we show that, under some cardinality assumptions, the 1-isomorphism property does not guarantee the compactness of a Loeb space, and in Section 7 an application of the 1-special model axiom is given on the existence of ergodic transformations of a Loeb space, which partially answers Problem 2.3 of [5]. (shrink)

We use formal semantic analysis based on new constructions to study abstract realizability, introduced by Läuchli in 1970, and expose its algebraic content. We claim realizability so conceived generates semantics-based intuitive confidence that the Heyting Calculus is an appropriate system of deduction for constructive reasoning.Well-known semantic formalisms have been defined by Kripke and Beth, but these have no formal concepts corresponding to constructions, and shed little intuitive light on the meanings of formulae. In particular, the completeness proofs for these semantics (...) do not generate confidence in the sufficiency of the Heyting Calculus, since we have no reason to believe that every intuitively constructive truth is valid in the formal semantics.Läuchli has proved completeness for a realizability semantics with formal concepts analogous to constructions. We argue in some detail that, in spite of a certain inherent inexactness of the analogy, every intuitively constructive truth is valid in Läuchli semantics, and therefore the Heyting Calculus is powerful enough to prove all constructive truths. Our argument is based on the postulate that a uniformly constructible object must be communicable in spite of imprecision in our language, and that the permutations in Läuchli's semantics represent conceivable imprecision in a language, while allowing a certain amount of freedom in choosing the particular structure of the language.We give a detailed generalization of Läuchli's proof of completeness for the propositional part of the Heyting Calculus, in order to make explicit constructive and algebraic content.In our treatment, we establish several new results about Läuchli models. We show how to extend the sconing and gluing constructions familiar from Kripke and Frame semantics and Topos theory, to Läuchli models, and use them to give an algebraic approach to countermodel construction. In particular, the Läuchli arguments are given without the restriction to the integers, Z, as a group of permutations, which makes much of the coding scheme used in Läuchli's original paper transparent.We also make use of a new propositions-as-types syntax for the Heyting calculus, with limited nondeterminism, in which validity of formulae can be decided without loop-detection. (shrink)

An effectively closed set, or ${\Pi^{0}_{1}}$ class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of ${\Pi^{0}_{1}}$ classes are shown to be mutually reducible via a computable permutation. Computable injective numberings are given for the family of ${\Pi^{0}_{1}}$ classes and (...) for the subclasses of decidable and of homogeneous ${\Pi^{0}_{1}}$ classes. However no computable numberings exist for small or thin classes. No computable numbering of trees exists that includes all computable trees without dead ends. (shrink)

Symmetric propositions over domain $\mathfrak{D}$ and signature $\Sigma = \langle R^{n_1}_1, \ldots, R^{n_p}_p \rangle$ are characterized following Zermelo, and a correlation of such propositions with logical type- $\langle \vec{n} \rangle$ quantifiers over $\mathfrak{D}$ is described. Boolean algebras of symmetric propositions over $\mathfrak{D}$ and Σ are shown to be isomorphic to algebras of logical type- $\langle \vec{n} \rangle$ quantifiers over $\mathfrak{D}$. This last result may provide empirical support for Tarski’s claim that logical terms over fixed domain are all and only those (...) invariant under domain permutations. (shrink)

The main aim of this work is to relate integrability in QFT with a complete particle interpretation directly to the principle of causal localization, circumventing the standard method of finding sufficiently many conservation laws. Its precise conceptual-mathematical formulation as “modular localization” within the setting of local operator algebras also suggests novel ways of looking at general (non-integrable) QFTs which are not based on quantizing classical field theories.Conformal QFT, which is known to admit no particle interpretation, suggest the presence of a (...) “partial” integrability, referred to as “conformal integrability”. This manifests itself in a “braid-permutation” group structure which contains in particular informations about the anomalous dimensional spectrum. For chiral conformal models this reduces to the braid group as it is represented in Hecke- or Birman-Wenzl-algebras associated to chiral models.Another application of modular localization mentioned in this work is an alternative to the BRST formulation of gauge theories in terms of stringlike vectorpotentials within a Hilbert space setting. (shrink)

is a presentation of mathematics in terms of the fundamental concepts of transformation, and composition of transformations. While the importance of these concepts had long been recognized in algebra (for example, by Galois through the idea of a group of permutations) and in geometry (for example, by Klein in his Erlanger Programm), the truly universal role they play in mathematics did not really begin to be appreciated until the rise of abstract algebra in the 1930s. In abstract (...) class='Hi'>algebra the idea of transformation of structure (homomorphism) was central from the beginning, and it soon became apparent to algebraists that its most important concepts and constructions were in fact formulable in terms of that idea alone. Thus emerged the view that the essence of a mathematical structure is to be sought not in its internal constitution, but rather in the nature of its relationships with other structures of the same kind, as manifested through the network of transformations. This idea has achieved its fullest expression in category theory, an axiomatic framework within which the notions of transformation (as morphism or arrow) and composition (and also structure, as object) are fundamental, that is, are not defined in terms of anything else. (shrink)

In this book, international experts from Europe and the United States address Lullism as a remarkable and distinctive method of thinking and experimenting. The origins and impact of Ramon Llull's oeuvre as a modern thinker are presented, and their interdisciplinary and intercultural implications, which continue to this day, are explored. Ars combinatoria, generative and permutative generation of texts, the epistemic and poetic power of algorithmic systems, plus the principle of unconditional dialogue between cultural groups and their individual members, are the (...) most important coordinates of this combinatorial-dialogical media and communication theory, which appeared very early in the history of science, technology, and art. It was developed in the work of Ramon Llull during the transition from the thirteenth to the fourteenth century when Arab-Islamic, Jewish, and Christian cultures intersected. The legacy of Lullism lives on in poetry and in the visual and electronic-based arts, as well as in research on the history of informatics, formal logic, and media archaeology. The primary idea of Llull's teachings--to enable rational and therefore trustworthy dialogue between cultures and religions through a universally valid system of symbols--is today still topical and of great relevance, especially in the tensions prevailing in globalized spaces of possibility. (shrink)

Applying Weglorz' mode s of set theory without the axiom of choice, we investigate Arrow-type social we fare functions for infinite societies with restricted coalition algebras. We show that there is a reasonable, nondictatorial social welfare function satisfying “finite discrimination”, if and only if in Weglorz' mode there is a free ultrafilter on a set representing the individuals.

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

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

The spacetime algebra (STA) is the natural, representation-free language for Dirac's theory of the electron. Conventional Pauli, Dirac, Weyl, and Majorana spinors are replaced by spacetime multivectors, and the quantum σ- and γ-matrices are replaced by two-sided multivector operations. The STA is defined over the reals, and the role of the scalar unit imaginary of quantum mechanics is played by a fixed spacetime bivector. The extension to multiparticle systems involves a separate copy of the STA for each particle, and (...) it is shown that the standard unit imaginary induces correlations between these particle spaces. In the STA, spinors and operators can be manipulated without introducing any matrix representation or coordinate system. Furthermore, the formalism provides simple expressions for the spinor bilinear covariants which dispense with the need for the Fierz identities. A reduction to2+1 dimensions is given, and applications beyond the Dirac theory are discussed. (shrink)

Daniel Sutherland - Kant on Arithmetic, Algebra, and the Theory of Proportions - Journal of the History of Philosophy 44:4 Journal of the History of Philosophy 44.4 533-558 Muse Search Journals This Journal Contents Kant on Arithmetic, Algebra, and the Theory of Proportions Daniel Sutherland Kant's philosophy of mathematics has both enthralled and exercised philosophers since the appearance of the Critique of Pure Reason. Neither the Critique nor any other work provides a sustained and focused account of his (...) mature views on mathematical cognition, forcing readers to glean what they can from disparate contexts. Despite these hurdles, Kant's views have been of great interest to philosophers of mathematics. They have also been of interest to philosophers wishing to understand Kant's philosophy more generally, since Kant maintains that mathematical judgments are synthetic a priori and that the type of synthesis underlying mathematics is the same as that underlying the perception of objects . Our understanding of Kant's views has been greatly improved during the last four decades by work on Kant's philosophy of mathematics. Despite these advances, however, I think the recent work has largely neglected the importance of Kant's theory of magnitudes and the extent to which that theory is influenced by the Eudoxian theory of proportions presented in Euclid's Elements. As a consequence, an important feature of Kant's.. (shrink)

We interpret the algebra of finite rank operators as imaginaries inside a Hilbert space. We prove that the Hilbert space enlarged with these imaginaries has built-in canonical bases.