Results 1 to 10 of about 111,956 (116)

Constructing Higher Inductive Types as Groupoid Quotients [PDF]

Logical Methods in Computer Science, 2021
In this paper, we study finitary 1-truncated higher inductive types (HITs) in homotopy type theory. We start by showing that all these types can be constructed from the groupoid quotient.
Niccolò Veltri, Niels van der Weide
doaj   +1 more source

A Coalgebraic Approach to Dualities for Neighborhood Frames [PDF]

Logical Methods in Computer Science, 2022
We develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras.
Guram Bezhanishvili, Nick Bezhanishvili, Jim de Groot   +2 more
doaj   +1 more source

Rule Algebras for Adhesive Categories [PDF]

Logical Methods in Computer Science, 2020
We demonstrate that the most well-known approach to rewriting graphical structures, the Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules along an overlap that is associative in a natural sense.
Nicolas Behr, Pawel Sobocinski
doaj   +1 more source

Strongly Complete Logics for Coalgebras [PDF]

Logical Methods in Computer Science, 2012
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras.
Alexander Kurz, Jiri Rosicky
doaj   +1 more source

Pseudo-free families and cryptographic primitives

Journal of Mathematical Cryptology, 2022
In this article, we study the connections between pseudo-free families of computational Ω\Omega -algebras (in appropriate varieties of Ω\Omega -algebras for suitable finite sets Ω\Omega of finitary operation symbols) and certain standard cryptographic ...
Anokhin Mikhail
doaj   +1 more source

Completeness for the coalgebraic cover modality [PDF]

Logical Methods in Computer Science, 2012
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional
Clemens Kupke, Alexander Kurz, Yde Venema   +2 more
doaj   +1 more source

Exact Unification and Admissibility [PDF]

Logical Methods in Computer Science, 2015
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics.
George Metcalfe, Leonardo Cabrer
doaj   +1 more source

Universal Quantitative Algebra for Fuzzy Relations and Generalised Metric Spaces [PDF]

Logical Methods in Computer Science
We present a generalisation of the theory of quantitative algebras of Mardare, Panangaden and Plotkin where (i) the carriers of quantitative algebras are not restricted to be metric spaces and can be arbitrary fuzzy relations or generalised metric spaces,
Matteo Mio, Ralph Sarkis, Valeria Vignudelli   +2 more
doaj   +1 more source

Pseudo-free families of computational universal algebras

Journal of Mathematical Cryptology, 2020
Let Ω be a finite set of finitary operation symbols. We initiate the study of (weakly) pseudo-free families of computational Ω-algebras in arbitrary varieties of Ω-algebras.
Anokhin Mikhail
doaj   +1 more source

Non-finitary Generalizations of Nil-triangular Subalgebras of Chevalley Algebras

Известия Иркутского государственного университета: Серия "Математика", 2019
Let $N\Phi(K)$ be a niltriangular subalgebra of Chevalley algebra over a field or ring $K$ associated with root system $\Phi$ of classical type. For type $A_{n-1}$ it is associated to algebra $NT(n,K)$ of (lower) nil-triangular $n \times n$- matrices ...
J. V. Bekker, V. M. Levchuk, E. A. Sotnikova   +2 more
doaj   +1 more source