Related papers: Induction in Algebra: a First Case Study
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…
One of the benefit properties implied by the extensionality axiom of Hilbert's epsilon calculus is that the calculus becomes complete with respect to the choice structures as semantics. Another implication of the axiom, discussed in the…
Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
W. A. Moens proved that a Lie algebra is nilpotent if and only if it admits an invertible Leibniz-derivation. In this paper we show that with the definition of Leibniz-derivation from W. A. Moens the similar result for non Lie Leibniz…
A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…
Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…
This paper shows an elementary and direct proof of the Fundamental Theorem of Algebra, via Bolzano-Weierstrass Theorem on Minima and the Binomial Formula, that avoids: any root extraction other than the one used to define the modulus…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
The Zorn's Algebra ZZ(R) has a multiplicative function called determinant with properties similar to the usual one. The set of elements in ZZ(R) with determinant 1 is a Moufang loop that we will denote by \GA. In our main result we prove…
Goedel's results have had a great impact in diverse fields such as philosophy, computer sciences and fundamentals of mathematics. The fact that the rule of mathematical induction is contradictory with the rest of clauses used by Goedel to…
The set of natural integers is fundamental for at least two reasons: it is the free induction algebra over the empty set (and at such allows definitions of maps by primitive recursion) and it is the free monoid over a one-element set, the…
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…
Aristotelian assertoric syllogistic, which is currently of growing interest, has attracted the attention of the founders of modern logic, who approached it in several (semantical and syntactical) ways. Further approaches were introduced…
We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…
I give a proof of Zel'manov's theorem that if $L$ is an $n$-Engel Lie algebra over a field $F$ of characteristic zero then $L$ is (globally) nilpotent. This is a very important result which extends Kostrikin's theorem that $L$ is locally…
Both the original Temperley-Lieb algebras $\mathsf{TL}_{n}$ and their dilute counterparts $\mathsf{dTL}_{n}$ form families of filtered algebras: $\mathsf{TL}_{n}\subset \mathsf{TL}_{n+1}$ and $\mathsf{dTL}_{n}\subset\mathsf{dTL}_{n+1}$, for…
It is known that, in univalent mathematics, type universes, the type of $n$-types in a universe, reflective subuniverses, and the underlying type of any algebra of the lifting monad are all (algebraically) injective. Here, we further show…
Let $L$ be a finite-dimensional Lie algebra over a field of non-zero characteristic and let $S$ be a subalgebra. Suppose that $X$ is a finite set of finite-dimensional $L$-modules. Let $D$ be the category of all finite-dimensional…