English
Related papers

Related papers: Modal group theory: homomorphisms

200 papers

We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…

Logic in Computer Science · Computer Science 2010-03-24 Ph. Balbiani , R. Echahed , A. Herzig

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Group Theory · Mathematics 2015-07-07 Emmanuel Jeandel

The present survey aims at being a list of Conjectures and Problems in an area of model-theoretic algebra wide open for research, not a list of known results. To keep the text compact, it focuses on structures of finite Morley rank,…

Logic · Mathematics 2019-09-09 Alexandre Borovik , Adrien Deloro

The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…

Logic in Computer Science · Computer Science 2015-02-18 Mikołaj Bojańczyk

The goal of the present paper is to provide a mathematically rigorous foundation to certain aspects of rational orbifold conformal field theory, in other words the theory of rational vertex operator algebras and their automorphisms. Under a…

q-alg · Mathematics 2009-10-30 Chongying Dong , Haisheng Li , Geoffrey Mason

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…

Formal Languages and Automata Theory · Computer Science 2019-05-09 Pablo Barcelo , Chih-Duo Hong , Xuan-Bach Le , Anthony W. Lin , Reino Niskanen

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…

Number Theory · Mathematics 2020-08-18 Andrei S. Rapinchuk , Igor A. Rapinchuk

Let $M$ be a $G$-manifold and $\om$ a $G$-invariant exact $m$-form on $M$. We indicate when these data allow us to constract a cocycle on a group $G$ with values in the trivial $G$-module $\mathbb R$ and when this cocycle is nontrivial.

Differential Geometry · Mathematics 2015-06-26 Mark Losik , Peter W. Michor

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

Logic in Computer Science · Computer Science 2026-05-19 Hirohiko Kushida

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…

Logic in Computer Science · Computer Science 2019-02-26 Miika Hannula , Åsa Hirvonen , Juha Kontinen , Vadim Kulikov , Jonni Virtema

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…

Group Theory · Mathematics 2013-07-19 Mark Brittenham , Susan Hermiller , Derek Holt

In this paper we provide a unifying description of different types of semantics of modal logic found in the literature via the framework of topological categories. In the style of categorical logic, we establish an exact correspondence…

Category Theory · Mathematics 2023-08-01 Lingyuan Ye

We show that string algebras are `homologically tame' in the following sense: First, the syzygies of arbitrary representations of a finite dimensional string algebra $\Lambda$ are direct sums of cyclic representations, and the left…

Representation Theory · Mathematics 2007-05-23 B. Huisgen-Zimmermann , S. O. Smalo

We introduce a natural concept of positive definiteness for bundle maps between Fell bundles over (possibly different) discrete groups and describe several examples. Such maps induce completely positive maps between the associated full…

Operator Algebras · Mathematics 2025-07-03 Erik Bédos , Roberto Conti

A group element is called a generalized torsion if a finite product of its conjugates is equal to the identity. We prove that in a nilpotent or FC-group, the generalized torsion elements are all torsion elements. Moreover, we compute the…

Group Theory · Mathematics 2025-08-28 Raimundo Bastos , Csaba Schneider , Danilo Silveira

We study two notions of definability for classes of relational structures based on modal extensions of {\L}ukasiewicz finitely valued-logics. The main results of the paper are the equivalent of the Goldblatt - Thomason theorem for these…

Logic · Mathematics 2015-11-26 Bruno Teheux

Given a finite group $G$, we introduce "encoding pairs," which are a pair of $G$-modules $M$ and $M'$ equipped with a shifted natural isomorphism between the cohomological functors $H^\bullet(G,\mathrm{Hom}_\mathbb Z(M,-))$ and…

Group Theory · Mathematics 2024-01-02 Nir Elber

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

Group Theory · Mathematics 2024-11-20 Ben Hayes , Srivatsav Kunnawalkam Elayavalli
‹ Prev 1 4 5 6 7 8 10 Next ›