Related papers: Induction in Algebra: a First Case Study
We prove that any finite subdirectly irreducible Heyting algebra with involution is quasi-primal, and that injective algebras in the variety generated by a finite subdirectly irreducible Heyting algebra are precisely diagonal subalgebras of…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…
We construct the Lafforgue variety, an affine scheme equipped with an open dense subscheme parametrizing the simple modules of a non-commutative unital algebra $R$ over any field $k$, provided that the center $Z(R)$ is finitely generated…
We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning). Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…
A fundamental theorem of linear algebra asserts that every basis for the vector space $\mathbb{R}^n$ has $n$ elements. In this expository note we present a theorem of W. G. Leavitt describing one way in which this invariant basis number…
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…
In this thesis new objects to the existing set of invariants of Lie algebras are added. These invariant characteristics are capable of describing the nilpotent parametric continuum of Lie algebras. The properties of these invariants, in…
Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…
This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…
Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…
In this paper, we study a notion of what we call vertex Leibniz algebra. This notion naturally extends that of vertex algebra without vacuum, which was previously introduced by Huang and Lepowsky. We show that every vertex algebra without…
In this note, the Zorn lemma is extended to arbitrary binary relations and thus the Zorn lemma can do for optimization when the transitivity is broken. Zorn's extended lemma can be used to prove existence theorems of generalized solution…
A (vector space) basis B of a Lie algebra is said to be very nilpotent if all the iterated brackets of elements of B are nilpotent. In this note, we prove a refinement of Engel's Theorem. We show that a Lie algebra has a very nilpotent…
The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification…