Related papers: Induction in Algebra: a First Case Study
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
Solomonoff's inductive learning model is a powerful, universal and highly elegant theory of sequence prediction. Its critical flaw is that it is incomputable and thus cannot be used in practice. It is sometimes suggested that it may still…
Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…
Let $B\rightarrow A$ be a homomorphism of Hopf algebras and let $C$ be an algebra. We consider the induction from $B$ to $A$ of $C$ in two cases: when $C$ is a $B$-interior algebra and when $C$ is a $B$-module algebra. Our main results…
In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…
We establish a flexible generalization of inductive systems of operator systems, which relaxes the usual transitivity (or coherence) condition to an asymptotic version thereof and allows for systems indexed over arbitrary nets. To…
In this paper we derive some basic results of circuit theory using `Implicit Linear Algebra' (ILA). This approach has the advantage of simplicity and generality. Implicit linear algebra is outlined in [1]. We denote the space of all vectors…
George Boros and Victor Moll's masterpiece "Irresistible Integrals" does well to include a suitably-titled appendix, "The Revolutionary WZ Method," which gives a brief overview of the celebrated Wilf--Zeilberger method of definite…
Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…
For a twisted affine Lie superalgebra with nonzero odd part, we study {tight irreducible weight modules} with bounded weight multiplicities and show that if the action of nonzero real vectors of each affine component of the zero part is…
Let Z be an affine algebraic variety and ED(Z)= max(2 dim Z+1, dim TZ). Let X be a smooth algebraic variety isomorphic to a semi-simple linear algebraic group whose Lie algebra is a sum of special linear Lie algebras. We show that if dim X…
For various series of complex semi-simple Lie algebras $\fg (t)$ equipped with irreducible representations $V(t)$, we decompose the tensor powers of $V(t)$ into irreducible factors in a uniform manner, using a tool we call {\it diagram…
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…
Premet has conjectured that the nilpotent variety of any finite-dimensional restricted Lie algebra is an irreducible variety. In this paper, we prove this conjecture in the case of Hamiltonian Lie algebra. and show that its nilpotent…
Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic…
An algebra is said to be quasi-directly finite when any left-invertible element in its unitization is automatically right-invertible. It is an old observation of Kaplansky that the von Neumann algebra of a discrete group has this property;…
Lorenzen's ``Algebraische und logistische Untersuchungen \"uber freie Verb\"ande'' appeared in 1951 in The Journal of Symbolic Logic. These ``Investigations'' have immediately been recognised as a landmark in the history of infinitary proof…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
We classify all nonnilpotent, solvable Leibniz algebras with the property that all proper subalgebras are nilpotent. This generalizes the work of Stitzinger and Towers in Lie algebras. We show several examples which illustrate the…
We prove two structure theorems for simple, locally finite dimensional Lie algebras over an algebraically closed field of characteristic $p$ which give sufficient conditions for the algebras to be of the form $[R^{(-)}, R^{(-)}] / (Z(R)…