English
Related papers

Related papers: Unification in subsystem J$_2$ of provability logi…

200 papers

Generalized Temperley-Lieb-Jones (TLJ) 2-categories associated to weighted bidirected graphs were introduced in unpublished work of Morrison and Walker. We introduce unitary modules for these generalized TLJ 2-categories as strong…

Operator Algebras · Mathematics 2026-01-06 Giovanni Ferrer , Roberto Hernandez Palomares

Let $G$ denote the projective special linear group $\text{PSL}(2,q)$, for a prime power $q$. It is shown that a finite 2-subgroup of the group $V(\mathbb{Z}G)$ of augmentation 1 units in the integral group ring $\mathbb{Z}G$ of $G$ is…

Group Theory · Mathematics 2008-10-02 Martin Hertweck , Christian R. Höfert , Wolfgang Kimmerle

For an arbitrary finite dimensional algebra $\Lambda$, we prove that any wide subcategory of $\mathsf{mod} \Lambda$ satisfying a certain finiteness condition is $\theta$-semistable for some stability condition $\theta$. More generally, we…

Representation Theory · Mathematics 2023-04-21 Toshiya Yurikusa

We describe the structure of bimodules (over finite dimensional algebras) which have the property that the functor of tensoring with such a bimodule sends any module to a projective module. The main result is that all such bimodules are…

Representation Theory · Mathematics 2019-06-24 Volodymyr Mazorchuk , Vanessa Miemietz , Xiaoting Zhang

We show that the universal unitary completion of certain locally algebraic representation of $G:=\GL_2(\Qp)$ with $p>2$ is non-zero, topologically irreducible, admissible and corresponds to a 2-dimensional crystalline representation with…

Representation Theory · Mathematics 2009-02-09 Vytautas Paskunas

We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program…

Programming Languages · Computer Science 2007-05-23 Danny De Schreye , Alexander Serebrenik

Using the non-semisimple Temperley-Lieb calculus, we study the additive and monoidal structure of the category of tilting modules for $\mathrm{SL}_{2}$ in the mixed case. This simultaneously generalizes the semisimple situation, the case of…

Representation Theory · Mathematics 2023-08-17 Louise Sutton , Daniel Tubbenhauer , Paul Wedrich , Jieru Zhu

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…

Group Theory · Mathematics 2008-08-12 Michael Bate , Benjamin Martin , Gerhard Roehrle , Rudolf Tange

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…

Logic · Mathematics 2016-12-19 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…

Logic in Computer Science · Computer Science 2015-07-01 Matthias Baaz , Agata Ciabattoni , Christian G Fermüller

It is shown that G-up, the quantified propositional Goedel-Dummett logic based on the truth-values set V-up = {1 - 1/n : n >= 1} u {1}, is decidable. This result is obtained by reduction to Buechi's theory S1S. An alternative proof based on…

Logic · Mathematics 2007-05-23 Matthias Baaz , Agata Ciabattoni , Richard Zach

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

The paper studies admissibility of multiple-conclusion rules in the positive logics. Using modification of a method used by M.~Wajsberg in the proof of the separation theorem, it is shown that the problem of admissibility in positive logics…

Logic · Mathematics 2016-10-28 Alex Citkin

In the framework of bidifferential graded algebras, we present universal solution generating techniques for a wide class of integrable systems.

Exactly Solvable and Integrable Systems · Physics 2008-06-30 Aristophanes Dimakis , Folkert Muller-Hoissen

K. Harada conjectured for any finite group $G$, the product of sizes of all conjugacy classes is divisible by the product of degrees of all irreducible characters. We study this conjecture when $G$ is the general linear group over a finite…

Group Theory · Mathematics 2024-11-19 Masahiro Sugimoto

Let $F$ be an algebraically closed field and consider the Lie algebra ${\mathfrak g}=\langle x\rangle\ltimes {\mathfrak a}$, where $\mathrm{ad}\, x$ acts diagonalizably on the abelian Lie algebra ${\mathfrak a}$. Refer to a ${\mathfrak…

Representation Theory · Mathematics 2014-08-12 Leandro Cagliero , Fernando Szechtman

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

Logic in Computer Science · Computer Science 2024-04-30 Hugo Férée , Iris van der Giessen , Sam van Gool , Ian Shillito

We introduce and investigate the notion of uniform Lyndon interpolation property (ULIP) which is a strengthening of both uniform interpolation property and Lyndon interpolation property. We prove several propositional modal logics including…

Logic · Mathematics 2020-01-14 Taishi Kurahashi

An l-group G is an abelian group equipped with a translation invariant lattice order. Baker and Beynon proved that G is finitely generated projective iff it is finitely presented. A unital l-group is an l-group G with a distinguished order…

Algebraic Topology · Mathematics 2009-07-20 Leonardo Cabrer , Daniele Mundici

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

Logic in Computer Science · Computer Science 2026-05-14 Tom de Jong , Nicolai Kraus , Aref Mohammadzadeh , Fredrik Nordvall Forsberg