English
Related papers

Related papers: Characteristic formulas over intermediate logics

200 papers

We show that for any finite-dimensional algebra $\Lambda$ of infinite representation type, over a perfect field, there is a bounded principal ideal domain $\Gamma$ and a representation embedding from $\Gamma -$mod into $\Lambda -$mod. As an…

Representation Theory · Mathematics 2024-06-24 Raymundo Bautista Ramos , Jesús Efrén Pérez Terrazas , Leonardo Salmerón Castro

We introduce characteristic numbers of a finite commutative unital $\mathbb{C}$-algebra, which are numerical invariants arising from algebraic intersection theory. We characterize Gorenstein and local complete intersection algebras in terms…

Algebraic Geometry · Mathematics 2025-07-29 Jakub Jagiełła , Paweł Pielasa , Anatoli Shatsila

We generalize a result of Araki (1985) on indecomposable group representations with invariant (necessarily indefinite) inner product and irreducible subrepresentation to Hopf $*$-algebras. Moreover, we characterize invariant inner products…

Quantum Algebra · Mathematics 2024-11-26 Quinn T. Kolt , Ziqian Zhao

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

Logic in Computer Science · Computer Science 2024-05-22 Michael Benedikt , Ehud Hrushovski

Non-iterative normal modal logics are defined by axioms of modal degree 1. In this paper we use calculations with normal forms to determine the set of all possible non-iterative normal modal logics, unimodal propositional extensions of K.…

Logic · Mathematics 2021-03-26 Adrian Soncodi

We investigate the extent to which Linear Temporal Logic (LTL) formulas can be uniquely characterized by a finite set of labeled examples. We consider different types of examples, ranging from finite words to transfinite words, as well as…

Logic in Computer Science · Computer Science 2026-04-27 Balder ten Cate , Dana Fisman , Roi Ohayon , Patrik Sestic

We study locally finite varieties (=primitive classes) of linear algebras over finite fields. We do not assume that our algebras are associative or Lie. We are interested in the basic properties of finite algebras in these varieties such…

Rings and Algebras · Mathematics 2026-03-11 Yuri Bahturin , Alexander Olshanskii

Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…

Rings and Algebras · Mathematics 2023-01-31 Vesselin S. Drensky

We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…

Rings and Algebras · Mathematics 2023-09-18 Snehinh Sen

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

We classify the finite groups whose non-linear irreducible characters that are not conjugate under the natural Galois action have distinct degrees, therefore extending the results in Berkovich et al. [Proc. Amer. Math. Soc. {\bf 115}…

Group Theory · Mathematics 2016-03-11 Silvio Dolfi , Manoj K. Yadav

We prove that finite groups have the same complex character tables iff the group algebras are twisted forms of each other as Drinfel'd quasi-bialgebras or iff there is non-associative bi-Galois algebra over these groups. The interpretations…

Representation Theory · Mathematics 2007-05-23 A. Davydov

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

Logic · Mathematics 2024-07-08 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

This paper presents a derivation of the possible residual symmetries of rational K-matrices which are invertible in the ''classical limit'' (the spectral parameter goes to infinity). This derivation uses only the boundary Yang-Baxter…

Mathematical Physics · Physics 2020-04-22 Tamas Gombor

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…

Logic · Mathematics 2026-03-02 Jim de Groot , Tadeusz Litak , Dirk Pattinson

The paper continues the line of model-theoretic characterizations for versions of intuitionistic logic previously achieved by the author, further generalizing them. This results in a model-theoretic characterization of expressive powers of…

Logic · Mathematics 2018-02-01 Grigory Olkhovikov

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…

Logic in Computer Science · Computer Science 2023-02-24 Libor Barto , Bertalan Bodor , Marcin Kozik , Antoine Mottet , Michael Pinsker

The concept of a supercharacter theory of a finite group was introduced by Diaconis and Isaacs as an alternative to the usual irreducible character theory, and exemplified with a particular construction in the case of finite algebra groups.…

Representation Theory · Mathematics 2021-01-28 Carlos A. M. André , Jocelyn Lochon

Algebras axiomatized entirely by rank 1 axioms are algebras for a functor and thus the free algebras can be obtained by a direct limit process. Dually, the final coalgebras can be obtained by an inverse limit process. In order to explore…

Logic in Computer Science · Computer Science 2015-07-01 Nick Bezhanishvili , Mai Gehrke

A bi-Heyting algebra validates the G\"odel-Dummett axiom $(p \to q) \lor (q \to p)$ iff the poset of its prime filters is a disjoint union of co-trees. Bi-Heyting algebras of this kind are called bi-G\"odel algebras and form a variety…

Logic · Mathematics 2026-02-26 Miguel Martins