English
Related papers

Related papers: Algebraicity and implicit definability in set theo…

200 papers

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding

Both algebraic and computational approaches for dealing with similarity spaces are well known in generalized rough set theory. However, these studies may be said to have been confined to particular perspectives of distinguishability in the…

Logic · Mathematics 2009-05-14 A. Mani

We analyze the hereditarily ordinal definable sets $\operatorname{HOD}$ in $M_n(x)[g]$ for a Turing cone of reals $x$, where $M_n(x)$ is the canonical inner model with $n$ Woodin cardinals build over $x$ and $g$ is generic over $M_n(x)$ for…

Logic · Mathematics 2021-01-19 Sandra Müller , Grigor Sargsyan

Starting from a biased definition of a properad, we describe explicitly algebras over the cobar construction of a properad. Equivalent description in terms of solutions of generalized master equations, which can be interpreted as…

Algebraic Topology · Mathematics 2018-05-18 Martin Doubek , Branislav Jurco , Lada Peksova

We introduce a finite-dimensional algebra that controls the possible boundary conditions of a conformal field theory. For theories that are obtained by modding out a Z_2 symmetry (corresponding to a so-called D_odd-type, or half-integer…

High Energy Physics - Theory · Physics 2009-10-30 J. Fuchs , C. Schweigert

We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…

Logic · Mathematics 2026-05-13 Erik Walsberg

Let $R$ be a finite unital commutative ring. We introduce a new class of finite groups, which we call hereditary groups over $R$. Our main result states that if $G$ is a hereditary group over $R$ then a unital algebra isomorphism between…

Representation Theory · Mathematics 2020-05-12 Taro Sakurai

We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch…

Logic · Mathematics 2026-05-19 Merlin Carl

We study general nilpotent algebras. The results obtained are new even for the classical algebras, such as associative or Lie algebras. We single out certain generic properties of finite-dimensional algebras, mostly over infinite fields.…

Rings and Algebras · Mathematics 2024-06-25 Yuri Bahturin , Alexander Olshanskii

We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…

Mathematical Physics · Physics 2009-11-10 S. Lombardo , A. V. Mikhailov

We explore an application of homological algebra to set theoretic objects by developing a cohomology theory for Hausdorff gaps. The cohomology theory is introduced with enough generality to be applicable to other questions in set theory.…

Logic · Mathematics 2016-09-06 Daniel Talayco

Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…

Logic · Mathematics 2025-07-09 Matteo De Berardinis , Silvio Ghilardi

In this paper we study injective modules over universal enveloping algebras of finite-dimensional Lie algebras over fields of arbitrary characteristic. Most of our results are dealing with fields of prime characteristic but we also…

Representation Theory · Mathematics 2007-05-23 Joerg Feldvoss

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

Logic · Mathematics 2024-11-20 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

There are several remarks on Hilbert series of finitely presented (f. p.) associative algebras over a field and their modules. First, given an integer $D$, the set of Hilbert series of right-sided ideals with generators and relations of…

Rings and Algebras · Mathematics 2007-05-23 Dmitri Piontkovski

Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…

Logic · Mathematics 2019-08-06 T. Moraschini

Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…

Operator Algebras · Mathematics 2019-03-27 Renat Gumerov , Ekaterina Lipacheva , Tamara Grigoryan

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)…

Logic · Mathematics 2023-01-09 Andrew Lewis-Smith Jaš Šemrl

We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…

Rings and Algebras · Mathematics 2023-12-12 Fred Greensite

In spite of several claims stating that some models are more interpretable than others -- e.g., "linear models are more interpretable than deep neural networks" -- we still lack a principled notion of interpretability to formally compare…

Artificial Intelligence · Computer Science 2020-11-16 Pablo Barceló , Mikaël Monet , Jorge Pérez , Bernardo Subercaseaux
‹ Prev 1 3 4 5 6 7 10 Next ›