English
Related papers

Related papers: Modal group theory

200 papers

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an {\em evidence logic} for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a…

Logic · Mathematics 2013-07-05 Johan van Benthem , David Fernández-Duque , Eric Pacuit

We study representations of wreath product analogues of categories of finite sets. This includes the category of finite sets and injections (studied by Church, Ellenberg, and Farb) and the opposite of the category of finite sets and…

Representation Theory · Mathematics 2019-05-14 Steven V Sam , Andrew Snowden

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

Rings and Algebras · Mathematics 2025-10-10 Dylan Johnston , Dmitriy Rumynin

We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…

Group Theory · Mathematics 2018-04-26 Nikolai Gordeev , Boris Kunyavskii , Eugene Plotkin

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…

Logic in Computer Science · Computer Science 2014-10-23 Henning Schnoor

We record a folklore theorem that says a partial group embeds in a group if and only if each word has at most one possible multiplication, regardless of choice of parenthesization. We further investigate the partial groups which are…

Group Theory · Mathematics 2026-03-12 Philip Hackney , Justin Lynd , Edoardo Salati

The aim of this paper is to propose a many-valued modal framework to formalize reasoning with both graded preferences and propositions, in the style of van Benthem et al.'s classical modal logics for preferences. To do so, we start from Bou…

Logic in Computer Science · Computer Science 2019-11-18 Amanda Vidal , Francesc Esteva , Lluis Godo

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Rafał Stefański

We study the category $\mathcal{A}$ of smooth semilinear representations of the infinite symmetric group over the field of rational functions in infinitely many variables. We establish a number of results about the structure of…

Representation Theory · Mathematics 2019-09-20 Rohit Nagpal , Andrew Snowden

These notes are based on a course given at the EPFL in May 2005. It is concerned with the representation theory of Hecke algebras in the non-semisimple case. We explain the role that these algebras play in the modular representation theory…

Representation Theory · Mathematics 2007-05-23 Meinolf Geck

Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…

Logic in Computer Science · Computer Science 2024-11-26 Victoria Vollmer , Danielle Marshall , Harley Eades , Dominic Orchard

A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be reasoned about (probabilistic, cyber-physical, etc.), the focus shifted to…

Logic in Computer Science · Computer Science 2021-05-24 Yuichi Komorida , Shin-ya Katsumata , Clemens Kupke , Jurriaan Rot , Ichiro Hasuo

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…

Formal Languages and Automata Theory · Computer Science 2020-05-22 Aalok Thakkar

In the first part, the second quantization procedure and the free Bosonic scalar field will be introduced, and the axioms for quantum fields and nets of observable algebras will be discussed. The second part is mainly devoted to an…

Operator Algebras · Mathematics 2011-02-01 Daniele Guido

We present an exposition of the theory of finite automata augmented with a multiply-only register storing an element of a given monoid or group. Included are a number of new results of a foundational nature. We illustrate our techniques…

Group Theory · Mathematics 2011-11-09 Mark Kambites

Motivated by appearance of multisemigroups in the study of additive $2$-categories, we define and investigate the notion of a multisemigroup with multiplicities. This notion seems to be better suitable for applications in higher…

Representation Theory · Mathematics 2015-10-07 Love Forsberg

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

Group Theory · Mathematics 2019-09-24 Alexander Olshanskii
‹ Prev 1 4 5 6 7 8 10 Next ›