English
Related papers

Related papers: Profiniteness, Monadicity and Universal Models in …

200 papers

Firm Frobenius algebras are firm algebras and counital coalgebras such that the comultiplication is a bimodule map. They are investigated by categorical methods based on a study of adjunctions and lifted functors. Their categories of…

Rings and Algebras · Mathematics 2013-07-18 Gabriella Böhm , José Gómez-Torrecillas

In this paper we develop the theory of operads, algebras and modules in cofibrantly generated symmetric monoidal model categories. We give J-semi model strucures, which are a slightly weaker version of model structures, for operads and…

Algebraic Topology · Mathematics 2007-05-23 Markus Spitzweck

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

The notion of overlap algebra introduced by G. Sambin provides a constructive version of complete Boolean algebra. Here we first show some properties concerning overlap algebras: we prove that the notion of overlap morphism corresponds…

Logic · Mathematics 2012-03-23 Francesco Ciraulo , Maria Emilia Maietti , Paola Toto

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

Algebraic Geometry · Mathematics 2008-08-20 E. Daniyarova , A. Myasnikov , V. Remeslennikov

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

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

Formal Languages and Automata Theory · Computer Science 2011-11-03 Michał Skrzypczak

The set of all transformation monoids on a fixed set of infinite cardinality \lambda, equipped with the order of inclusion, forms a complete algebraic lattice Mon(\lambda) with 2^{\lambda} compact elements. We show that this lattice is…

Rings and Algebras · Mathematics 2011-11-02 Michael Pinsker , Saharon Shelah

For every finitary monad $T$ on sets and every endofunctor $F$ on the category of $T$-algebras we introduce the concept of an ffg-Elgot algebra for $F$, that is, an algebra admitting coherent solutions for finite systems of recursive…

Logic in Computer Science · Computer Science 2021-09-10 Stefan Milius , Jiří Adámek , Henning Urbat

The paper aims to develop a framework for coalgebraic fuzzy geometric logic by adding modalities to the language of fuzzy geometric logic. Using the methods of coalgebra, the modal operators are introduced in the language of fuzzy geometric…

Logic in Computer Science · Computer Science 2022-09-08 Litan Kumar Das , Kumar Sankar Ray , Prakash Chandra Mali

We determine the profinite completions of MV-algebras, and obtain a description that generalizes the well known profinite completions of Boolean algebras as the power sets of their Stone spaces. We also use the description found to…

Logic · Mathematics 2016-08-30 Jean B Nganou

We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary…

Logic · Mathematics 2026-05-05 Nikolai L. Poliakov , Denis I. Saveliev

In this paper we investigate certain systems of propositional intuitionistic modal logic defined semantically in terms of neighborhood structures. We discuss various restrictions imposed on those frames but our constant approach is to…

Logic · Mathematics 2018-01-19 Tomasz Witczak

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur

In this survey, we first present basic facts on A-infinity algebras and modules including their use in describing triangulated categories. Then we describe the Quillen model approach to A-infinity structures following K. Lefevre's thesis.…

Representation Theory · Mathematics 2007-05-23 Bernhard Keller

Algebraic theories, sometimes called equational theories, are syntactic notions given by finitary operations and equations, such as monoids, groups, and rings. There is a well-known category-theoretic treatment of them that algebraic…

Category Theory · Mathematics 2026-03-31 Yuto Kawase

A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…

Commutative Algebra · Mathematics 2026-05-13 Roberto Díaz , Giancarlo Lucchini Arteche

In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…

Quantum Physics · Physics 2026-02-19 Olivier Brunet

An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…

General Relativity and Quantum Cosmology · Physics 2014-08-20 I. P. Costa e Silva , J. L. Flores

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…

Logic in Computer Science · Computer Science 2015-06-25 Baltasar Trancón y Widemann , Michael Hauhs
‹ Prev 1 4 5 6 7 8 10 Next ›