Related papers: Semisimplicity, Glivenko theorems, and the exclude…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
We suggest a geometrical approach to the semi-invariants of quivers based on Luna's slice theorem and the Luna-Richardson theorem. The locally semi-simple representations are defined in this spirit but turn out to be connected with stable…
This work is concerned with Mishchenko-Fomenko subalgebras and their restrictions to the adjoint orbits in a finite-dimensional complex semisimple Lie algebra. In this setting, it is known that each Mishchenko-Fomenko subalgebra restricts…
Our earlier publications showed semantic tableau admits partial exceptions to the Second Incompleteness Theorem where a formalism recognizes its self consistency and views multiplication as a 3-way relation (rather than as a total…
We investigate the properties of principal elements of Frobenius Lie algebras, following the work of M. Gerstenhaber and A. Giaquinto. We prove that any Lie algebra with a left symmetric algebra structure can be embedded, in a natural way,…
A hemiimplicative semilattice is a bounded semilattice $(A, \wedge, 1)$ endowed with a binary operation $\to$, satisfying that for every $a, b, c \in A$, $a \leq b \to c$ implies $a \wedge b \leq c$ (that is to say, one of the conditionals…
We realise Buchweitz and Flenner's semiregularity map (and hence a fortiori Bloch's semiregularity map) for a smooth variety $X$ as the tangent of a generalised Abel--Jacobi map on the derived moduli stack of perfect complexes on $X$. The…
We extend the notion of semi-infinite cohomology of Lie algebras to include cases where the Lie algebra does not admit a semi-infinite structure but satisfies a mild condition. Our construction clarifies the definition of affine W-algebras…
We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…
The multi-valued logic of {\L}ukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation, [DNE]. However, our…
Let $\mathfrak{g}$ be a semisimple complex Lie algebra of finite dimension and $\mathfrak{h}$ be a semisimple subalgebra. We present an approach to find the branching rules for the pair $\mathfrak{g}\supset\mathfrak{h}$. According to an…
In representation theory of finite-dimensional algebras, (semi)bricks are a generalization of (semi)simple modules, and they have long been studied. The aim of this paper is to study semibricks from the point of view of $\tau$-tilting…
It is known that many modal and superintuitionistic logics are PSPACE-hard in languages with a small number of variables; however, questions about the complexity of similar fragments of many logics obtained by adding various axioms to…
We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and f is a non-trivial irreducible…
Let L be a finite dimensional simple Lie algebra over an algebraically closed field of characteristic p>3. We prove in this paper that if all tori of maximal dimansion in the semisimple p-envelope of L are standard, the L is up to…
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…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
We provide a necessary and sufficient condition for a type D Temperley-Lieb algebra ${\rm TLD}_n(\delta)$ being semi-simple by studying branching rule for cell modules. As a byproduct, our result is used to study the so-called forked…
We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…