English
Related papers

Related papers: Almost structural completeness; an algebraic appro…

200 papers

We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a…

Logic · Mathematics 2014-08-21 Miguel Campercholi , Michal M. Stronkowski , Diego Vaggione

In this work we study the notions of structural and universal completeness both from the algebraic and logical point of view. In particular, we provide new algebraic characterizations of quasivarieties that are actively and passively…

Logic · Mathematics 2023-09-26 Paolo Aglianò , Sara Ugolini

In this paper we study various forms of (hereditary) structural completeness for quasivarieties of algebras, using mostly algebraic techniques. More specifically we study relative weakly projective algebras and the way they interact with…

Logic · Mathematics 2024-01-08 Paolo Aglianó , Alex CItkin

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…

Logic in Computer Science · Computer Science 2015-07-01 George Metcalfe , Christoph Röthlisberger

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…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

We introduce the notion of a cellular system in order to deal with quasi-hereditary algebras. We shall prove that a necessary and sufficient condition for an algebra to be quasi-hereditary is the existence of a full divisible cellular…

Representation Theory · Mathematics 2007-05-23 Jie Du

Positive modal algebras are the positive-subreducts of modal algebras. We prove that the variety of positive S4-algebras is not locally finite. On the other hand, the free one-generated positive S4-algebra is shown to be finite. Moreover,…

Logic · Mathematics 2019-08-06 T. Moraschini

A quasi-hereditary algebra is an algebra equipped with a certain partial order $\unlhd$ on its simple modules. Such a partial order -- called a quasi-hereditary structure -- gives rise to a characteristic tilting module $T_{\unlhd}$ by a…

Representation Theory · Mathematics 2025-07-23 Takahide Adachi , Aaron Chan , Yuta Kimura , Mayu Tsukamoto

A variety is said to be coherent if the finitely generated subalgebras of its finitely presented members are also finitely presented. In a recent paper by the authors it was shown that coherence forms a key ingredient of the uniform…

Logic · Mathematics 2019-02-08 Tomasz Kowalski , George Metcalfe

A cell algebra structure is found for a family of generalized Schur algebras previously studied by the author. This cell algebra structure is then used to construct the irreducible representations of these algebras and to determine when the…

Representation Theory · Mathematics 2016-01-18 Robert D. May

A quasivariety K of algebras has the joint embedding property (JEP) iff it is generated by a single algebra A. It is structurally complete iff the free countably generated algebra in K can serve as A. A consequence of this demand, called…

Logic · Mathematics 2019-02-13 T. Moraschini , J. G. Raftery , J. J. Wannenburg

Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…

Logic · Mathematics 2025-10-28 Xiaohao Liu , Heyan Wang , Wenjuan Chen

The paper studies hereditarily complete superintuitionistic deductive systems, that is, the deductive system which logic is an extension of the intuitionistic propositional logic. It is proven that for deductive systems a criterion of…

Logic · Mathematics 2016-11-16 Alex Citkin

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

A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi$ (i.e., local…

Logic · Mathematics 2019-05-15 Miloš S. Kurilić

In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…

Rings and Algebras · Mathematics 2014-03-26 Jouni Järvinen , Piero Pagliani , Sándor Radeleczki

The categories of almost modules and almost algebras are introduced as a convenient setting for the development of Faltings' method of almost etale extensions. After some preliminaries of general "almost homological algebra" we construct…

Algebraic Geometry · Mathematics 2007-05-23 Ofer Gabber , Lorenzo Ramero

A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…

Quantum Algebra · Mathematics 2007-05-23 Atsushi Matsuo , Kiyokazu Nagatomo , Akihiro Tsuchiya

The main results on the theory of conformal and almost Grassmann structures are presented. The common properties of these structures and also the differences between them are outlined. In particular, the structure groups of these structures…

Differential Geometry · Mathematics 2007-05-23 Maks A. Akivis , Vladislav V. Goldberg

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty
‹ Prev 1 2 3 10 Next ›