English
Related papers

Related papers: Structural and universal completeness in algebra a…

200 papers

We survey the state of the art on amalgamation in varieties of semilinear residuated lattices. Our discussion emphasizes two prominent cases from which much insight into the general picture may be gleaned: idempotent varieties and their…

Rings and Algebras · Mathematics 2024-08-01 Wesley Fussner , Simon Santschi

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

Group Theory · Mathematics 2022-06-23 Peter M Higgins , Marcel Jackson

This paper establishes a categorical equivalence between the category $\mathbb{COL}$ of complete orthomodular lattices and the category $\mathscr{T}\mathbb{ODA}$ of $\mathscr{T}$-based orthomodular dynamic algebras. Complete orthomodular…

Logic · Mathematics 2026-04-07 Jan Paseka , Juanda Kelana Putra , Richard Smolka

We consider varieties generated by finite closure algebras whose canonical relations have two levels, and whose restriction to a level is an "extremal" relation, i.e. the identity or the universal relation. The corresponding logics have…

Logic · Mathematics 2023-09-21 Ivo Düntsch , Wojciech Dzik

We consider the problem of extending maps from algebras to their profinite completions in finitely generated quasivarieties. Our developments are based on the construction of the profinite completion of an algebra as its natural extension.…

Rings and Algebras · Mathematics 2019-06-10 Georges Hansoul , Bruno Teheux

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…

Logic · Mathematics 2023-06-22 Alex Kruckman , Lawrence S. Moss

We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…

Category Theory · Mathematics 2026-02-10 Ivan Kuzmin , Chad Nester , Ülo Reimaa , Sam Speight

Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…

In this paper we prove that, in the category of chain complexes, partial algebras can be functorially replaced by quasi-isomorphic algebras. In particular, partial algebras contain all of the important homological and homotopical…

Algebraic Topology · Mathematics 2011-02-11 Scott O. Wilson

A self-contained description of algebraic structures, obtained by combinations of various limit procedures applied to vertex and face sl(2) elliptic quantum affine algebras, is given. New double Yangians structures of dynamical type are in…

Quantum Algebra · Mathematics 2008-11-26 D. Arnaudon , J. Avan , L. Frappat , E. Ragoucy , M. Rossi

We show that quasi-projective relation algebras and directed cylindric algebras are equivalent categorialy. We work out a Godels second incompleteness theorem for finite varibale fragments of first order logic. We show that distinct set…

Logic · Mathematics 2013-04-04 Tarek Sayed Ahmed

We use tools of mathematical logic to analyse the notion of a path on an complex algebraic variety, and are led to formulate a "rigidity" property of fundamental groups specific to algebraic varieties, as well as to define a bona fide…

Algebraic Geometry · Mathematics 2009-05-12 Misha Gavrilovich

Quantified CTL (QCTL) is a well-studied temporal logic that extends CTL with quantification over atomic propositions. It has recently come to the fore as a powerful intermediary framework to study logics for strategic reasoning. We extend…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type. However, popular…

Logic in Computer Science · Computer Science 2016-06-10 Lutz Schröder , Yde Venema

We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…

Logic in Computer Science · Computer Science 2024-10-22 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

In this paper we study $\mathcal{MV}^+$, i.e. the positive fragment of {\L}ukasiewicz Multi-Valued Logic $\mathcal{MV}$. In particular we describe all the finitary extensions of $\mathcal{MV}^+$ that are structurally complete and all the…

Logic · Mathematics 2023-10-02 Paolo Aglianò , Francesco Manfucci

We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…

Representation Theory · Mathematics 2020-06-30 Stephen Zito

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…

Logic in Computer Science · Computer Science 2015-07-01 François Laroussinie , Antoine Meyer , Eudes Petonnet
‹ Prev 1 8 9 10 Next ›