English
Related papers

Related papers: Algebraic Theories over Nominal Sets

200 papers

We introduce quantum monadic and quantum cylindric algebras. These are adaptations to the quantum setting of the monadic algebras of Halmos, and cylindric algebras of Henkin, Monk and Tarski, that are used in algebraic treatments of…

Logic · Mathematics 2022-10-05 John Harding

The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…

Rings and Algebras · Mathematics 2008-12-11 Slavcho Shtrakov , Klaus Denecke

This thesis provides an introduction to the various category theory ideas employed in topological quantum field theory. These theories are viewed as symmetric monoidal functors from topological cobordism categories into the category of…

Quantum Algebra · Mathematics 2007-05-23 Bruce H. Bartlett

In this article we show how to build main aspects of our paper on globular weak $(\infty,n)$-categories, but now for the cubical geometry. Thus we define a monad on the category $\mathbb{C}\mathbb{S}ets$ of cubical sets which algebras are…

K-Theory and Homology · Mathematics 2019-10-24 Camell Kachour

We consider categories of relational structures that fully embed every category of universal algebras, and prove a partial characterisation of these in terms of an infinitary variant of the notion of nowhere density of Ne\v{s}et\v{r}il and…

Logic · Mathematics 2023-03-24 Ioannis Eleftheriadis

It is commonly believed that algebraic notions of type theory support only universes \`a la Tarski, and that universes \`a la Russell must be removed by elaboration. We clarify the state of affairs, recalling the details of Cartmell's…

Logic in Computer Science · Computer Science 2019-02-26 Jonathan Sterling

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

Dynamical Systems · Mathematics 2012-09-27 Bernard Host , Bryna Kra

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

Nominal techniques provide a mathematically principled approach to dealing with names and variable binding in programming languages. This paper explores an attempt to make nominal techniques accessible as an Agda library. We aim for a…

Programming Languages · Computer Science 2026-03-05 Murdoch J. Gabbay , Orestis Melkonian

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

History and Overview · Mathematics 2015-04-23 Piotr Błaszczyk

In this paper we show how the theory of monads can be used to deduce in a uniform manner several duality theorems involving categories of relations on one side and categories of algebras with homomorphisms preserving only some operations on…

Logic · Mathematics 2013-02-25 Dirk Hofmann , Pedro Nora

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

In this paper we introduce the notion of dynamical systems over the class of the normed real nonassociative algebras not necessarily finite-dimensional, generalize the classical filled Julia and Mandelbrot sets over the complex numbers,…

Dynamical Systems · Mathematics 2020-09-22 João Carlos da Motta Ferreira , Maria das Graças Bruno Marietto

In this article, we generalize some frequently used metrical notions such as: completeness, closedness, continuity, g-continuity and compatibility to relation-theoretic setting and utilize these relatively weaker notions to prove results on…

Functional Analysis · Mathematics 2021-09-03 Aftab Alam , Mohammad Imdad

The term UniMath refers both to a formal system for mathematics, as well as a computer-checked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Ralph Matthes , Anders Mörtberg

For finitary regular monads T on locally finitely presentable categories we characterize the finitely presentable objects in the category of T-algebras in the style known from general algebra: they are precisely the algebras presentable by…

Category Theory · Mathematics 2019-09-06 Jiří Adámek , Stefan Milius , Lurdes Sousa , Thorsten Wißmann

We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are…

Logic in Computer Science · Computer Science 2023-06-22 Samuel Balco , Alexander Kurz

A local existence and uniqueness theorem for ODEs in the special algebra of generalized functions is established, as well as versions including parameters and dependence on initial values in the generalized sense. Finally, a Frobenius…

Functional Analysis · Mathematics 2017-01-10 Evelina Erlacher , Michael Grosser

Nominal unification calculates substitutions that make terms involving binders equal modulo alpha-equivalence. Although nominal unification can be seen as equivalent to Miller's higher-order pattern unification, it has properties, such as…

Logic in Computer Science · Computer Science 2010-12-23 Christian Urban

There are many ways to represent the syntax of a language with binders. In particular, nominal frameworks are metalanguages that feature (among others) name abstraction types, which can be used to specify the type of binders. The resulting…

Logic in Computer Science · Computer Science 2026-05-25 Antoine Van Muylder , Andreas Nuyts , Dominique Devriese
‹ Prev 1 3 4 5 6 7 10 Next ›