English
Related papers

Related papers: Converse extensionality and apartness

200 papers

In this article we analyze the notions of amenability and paradoxical decomposition from an algebraic perspective. We consider this dichotomy for locally finite extended metric spaces and for general algebras over commutative fields. In the…

Rings and Algebras · Mathematics 2018-08-08 Pere Ara , Kang Li , Fernando Lledó , Jianchao Wu

A bisimulation for a coalgebra of a functor on the category of sets can be described via a coalgebra in the category of relations, of a lifted functor. A final coalgebra then gives rise to the coinduction principle, which states that two…

Logic in Computer Science · Computer Science 2023-06-22 Herman Geuvers , Bart Jacobs

Invertibility is an important concept in category theory. In higher category theory, it becomes less obvious what the correct notion of invertibility is, as extra coherence conditions can become necessary for invertible structures to have…

Category Theory · Mathematics 2020-10-20 Alex Rice

We present an overview of a theory of complex dimensions of self-similar fractal strings, and compare this theory to the theory of varieties over a finite field from the geometric and the dynamical point of view. Then we combine the several…

Number Theory · Mathematics 2007-05-23 Michel L. Lapidus , Machiel van Frankenhuijsen

We introduce a class of strongly \'{e}tale difference algebras, whose role in the study of difference equations is analogous to the role of \'{e}tale algebras in the study of algebraic equations. We deduce an improved version of Babbitt's…

Algebraic Geometry · Mathematics 2018-02-23 Ivan Tomašić , Michael Wibmer

Arboreal categories provide an axiomatic framework in which abstract notions of bisimilarity and back-and-forth games can be defined. They act on extensional categories, typically consisting of relational structures, via arboreal…

Logic in Computer Science · Computer Science 2025-02-05 Luca Reggio , Colin Riba

We define abelian extensions of algebras in congruence-modular varieties. The theory is sufficiently general that it includes, in a natural way, extensions of R-modules for a ring R. We also define a cohomology theory, which we call clone…

Rings and Algebras · Mathematics 2007-05-23 William H. Rowan

Mechanistic interpretability aims to explain neural model behaviour by reverse-engineering learned computational structure into human-understandable components. Without a formal framework, however, mechanistic explanations cannot be…

Machine Learning · Computer Science 2026-05-12 Ward Gauderis , Thomas Dooms , Steven T. Holmer , Kola Ayonrinde , Geraint A. Wiggins

We introduce a canonical isomorphism from the space of pure-type complex differential forms on a compact complex manifold to the one on its infinitesimal deformations. By use of this map, we generalize an extension formula in a recent work…

Complex Variables · Mathematics 2019-09-30 Sheng Rao , Quanting Zhao

We explore the geometric notion of prolongations in the setting of computational algebra, extending results of Landsberg and Manivel which relate prolongations to equations for secant varieties. We also develop methods for computing…

Commutative Algebra · Mathematics 2008-04-03 Jessica Sidman , Seth Sullivant

The paper proposes another extension of the extremal principle. A new extremality model involving collections of arbitrary families of sets is studied. It generalizes the conventional model based on linear translations of given sets as well…

Optimization and Control · Mathematics 2024-09-04 Nguyen Duy Cuong , Alexander Y. Kruger , Nguyen Hieu Thao

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

Logic · Mathematics 2023-05-02 Morenikeji Neri , Thomas Powell

We propose a novel perspective to understand deep neural networks in an interpretable disentanglement form. For each semantic class, we extract a class-specific functional subnetwork from the original full model, with compressed structure…

Machine Learning · Computer Science 2019-10-08 Yulong Wang , Xiaolin Hu , Hang Su

We first present a Priestley-style dualitiy for the classes of algebras that are the algebraic counterpart of some congruential, finitary and filter-distributive logic with theorems. Then we analyze which properties of the dual spaces…

Logic · Mathematics 2025-10-14 María Esteban , Ramon Jansana

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…

Logic · Mathematics 2016-09-21 Benno van den Berg

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

Logic in Computer Science · Computer Science 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

An important goal in studying the relations between unitary VOAs and conformal nets is to prove the equivalence of their ribbon categories. In this article, we prove this conjecture for many familiar examples. Our main idea is to construct…

Quantum Algebra · Mathematics 2021-04-06 Bin Gui

We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…

Representation Theory · Mathematics 2017-11-01 Simon F Peacock

We present a general and user-extensible equality checking algorithm that is applicable to a large class of type theories. The algorithm has a type-directed phase for applying extensionality rules and a normalization phase based on…

Logic in Computer Science · Computer Science 2023-06-22 Andrej Bauer , Anja Petković Komel