Related papers: Characteristic formulas over intermediate logics
Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…
We consider a class of extensions of associative algebras, which we refer to as ``strongly proj-bounded extensions''. We prove that the finiteness of the left global dimension and the support of the Hochschild homology is preserved by…
The representations of the degenerate affine Hecke algebra in which the analogues of the Dunkl operators are given by finite-difference operators are introduced. The non-selfadjoint lattice analogues of the spin Calogero-Sutherland…
We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…
We study automorphic Lie algebras and their applications to integrable systems. Automorphic Lie algebras are a natural generalisation of celebrated Kac-Moody algebras to the case when the group of automorphisms is not cyclic. They are…
Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…
We prove that the finiteness of a finitely generated category of irreducible algebraic varieties over a field of characteristic zero is decidable. We also obtain a Burnside finiteness criterion for such a category, with applications to…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…
In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…
We show that there exist (continuum many) varieties of bi-Heyting algebras that are not generated by their complete members. It follows that there exist (continuum many) extensions of the Heyting-Brouwer logic $\mathsf{HB}$ that are…
Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…
It was shown recently that epimorphisms need not be surjective in a variety K of Heyting algebras, but only one counter-example was exhibited in the literature until now. Here, a continuum of such examples is identified, viz. the variety…
We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…
Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…
A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…
By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…
Many finite symmetric integral non-representable relation algebras, including almost all Monk algebras, can be embedded in the completion of an atomic symmetric integral representable relation algebra whose finitely-generated subalgebras…
Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…
Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…