Related papers: Induction in Algebra: a First Case Study
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
The main result of the paper establishes the irreducibility of a large family of nonzero central charge induced modules over Affine Lie algebras for any non standard parabolic subalgebra. It generalizes all previously known partial results…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
The induction and reduction precesses of an O*-vector space $\M$ obtained by means of a projection taken, respectively, in $\M$ itself or in its weak bounded commutant $\M'_\w$ are studied. In the case where $\M$ is a partial GW*-algebra,…
The discrete LS algebra over a totally ordered set is the homogeneous coordinate ring of an irreducible projective (normal) toric variety. We prove that this algebra is the ring of invariants of a finite abelian group containing no…
Let $L$ be a nilpotent algebra of class two over a compact discrete valuation ring $A$ of characteristic zero or of sufficiently large positive characteristic. Let $q$ be the residue cardinality of $A$. The ideal zeta function of $L$ is a…
In this paper, we establish a converse to Schur's theorem for Lie superalgebras \( L \), focusing on cases where the minimal generator number pairs \((p \vert q)\) of \( L/Z(L) \) are considered, and where the superdimension \(…
Assuming Schanuel's Conjecture we prove that for any variety V over the algebraic closure over the rational numbers, of dimension n and with dominant projections, there exists a generic point in V. We obtain in this way many instances of…
We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…
We show that the relative Farrell-Jones assembly map from the family of finite subgroups to the family of virtually cyclic subgroups for algebraic K-theory is split injective in the setting where the coefficients are additive categories…
Let $\mathfrak{g}$ be a finite-dimensional simple complex Lie algebra. A layer sum is introduced as the sum of formal exponentials of the distinct weights appearing in an irreducible $\mathfrak{g}$-module. It is argued that the character of…
We introduce a coinductive version of the well-foundedness of N that is used in our proof within minimal logic of the constructive counterpart CLNP to the standard least number principle LNP. According to CLNP, an inhabited complemented…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
We prove that the propositional logic of intuitionistic set theory IZF is intuitionistic propositional logic IPC. More generally, we show that IZF has the de Jongh property with respect to every intermediate logic that is complete with…
This paper explores formalizing Geometric (or Clifford) algebras into the Lean 3 theorem prover, building upon the substantial body of work that is the Lean mathematics library, mathlib. As we use Lean source code to demonstrate many of our…
In this paper, we introduce the notion of completely non-trivial module of a Lie conformal algebra. By this notion, we classify all finite irreducible modules of a class of $\mathbb{Z}^+$-graded Lie conformal algebras…
The goal of inductive logic programming (ILP) is to find a set of logical rules that generalises training examples and background knowledge. We introduce an ILP approach that identifies pointless rules. A rule is pointless if it contains a…
We prove the non-abelian Poincare lemma in higher gauge theory in two different ways. The first method uses a result by Jacobowitz which states solvability conditions for differential equations of a certain type. The second method extends a…
In this article, we introduce the notion of a curved absolute $\mathcal{L}_\infty$-algebra, a structure that behaves like a curved $\mathcal{L}_\infty$-algebra where all infinite sums of operations are well-defined by definition. We develop…