English
Related papers

Related papers: Normalization and coherence for $\infty$-type theo…

200 papers

The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…

Logic · Mathematics 2026-01-01 Karim Khanaki , Massoud Pourmahdian

We characterize $t$-structures in stable $\infty$-categories as suitable quasicategorical factorization systems. More precisely we show that a $t$-structure $\mathfrak{t}$ on a stable $\infty$-category $\mathbf{C}$ is equivalent to a normal…

Category Theory · Mathematics 2017-12-05 Domenico Fiorenza , Fosco Loregian

Inference systems are a widespread framework used to define possibly recursive predicates by means of inference rules. They allow both inductive and coinductive interpretations that are fairly well-studied. In this paper, we consider a…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Dagnino

Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…

Logic · Mathematics 2012-11-06 Francesco Ciraulo , Maria Emilia Maietti , Giovanni Sambin

Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…

Category Theory · Mathematics 2008-02-06 Claudio Pisani

Convergence is a fundamental topic in analysis that is most commonly modelled using topology. However, there are many natural convergences that are not given by any topology; e.g., convergence almost everywhere of a sequence of measurable…

Functional Analysis · Mathematics 2021-03-03 M. O'Brien , V. G. Troitsky , J. H. van der Walt

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

Logic in Computer Science · Computer Science 2017-07-04 Lorenzo Gheri , Andrei Popescu

Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…

Artificial Intelligence · Computer Science 2022-08-08 Simon Marynissen , Bart Bogaerts

In nature, one observes that a K-theory of an object is defined in two steps. First a "structured" category is associated to the object. Second, a K-theory machine is applied to the latter category to produce an infinite loop space. We…

K-Theory and Homology · Mathematics 2013-04-03 Nicolas Michel

We develop the general Theory of Cayley Hamilton algebras using norms and compare with the approach, valid only in characteristic 0, using traces and presented in a previous paper $T$-ideals of Cayley Hamilton algebras, 2020,…

Representation Theory · Mathematics 2020-11-11 Claudio Procesi

We adjust the notion of typicality originated with Russell, which was introduced and studied in a previous paper for general first-order structures, to make it expressible in the language of set theory. The adopted definition of the class…

Logic · Mathematics 2023-03-22 Athanassios Tzouvaras

We investigate to what extent renormalization can be understood as an algebraic manipulation on concatenated one-loop integrals. We find that the resulting algebra indicates a useful connection to knot theory as well as number theory and…

q-alg · Mathematics 2011-06-20 Dirk Kreimer

We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…

Logic · Mathematics 2013-05-29 Assaf Hasson , Misha Gavrilovich

This expository note describes two convenient techniques in the context of homotopy type theory for proving and formalizing that a given map is an equivalence. The first technique decomposes the map as a series of basic equivalences, while…

Logic in Computer Science · Computer Science 2025-09-09 Tom de Jong

Traditional machine learning relies on explicit models and domain assumptions, limiting flexibility and interpretability. We introduce a model-free framework using surprisal (information theoretic uncertainty) to directly analyze and…

Stemming from de Finetti's work on finitely additive coherent probabilities, the paradigm of coherence has been applied to many uncertainty calculi in order to remove structural restrictions on the domain of the assessment. Three possible…

Probability · Mathematics 2021-06-30 Davide Petturiti , Barbara Vantaggi

We describe a category, the objects of which may be viewed as models for homotopy theories. We show that for such models, ``functors between two homotopy theories form a homotopy theory'', or more precisely that the category of such models…

Algebraic Topology · Mathematics 2008-12-05 Charles Rezk

We give a systematic, abstract formulation of the image normalization method as applied to a general group of image transformations, and then illustrate the abstract analysis by applying it to the hierarchy of viewing transformations of a…

Computer Vision and Pattern Recognition · Computer Science 2007-05-23 Stephen L. Adler

The concept of coherence is one of cornerstones in physics. The development of quantum information science has lead to renewed interest in properly approaching the coherence at the quantum level. Various measures could be proposed to…

Quantum Physics · Physics 2016-04-06 Alexey E. Rastegin

Quantifier-elimination or model-completeness of the affine part of some classical first order theories are proved.

Logic · Mathematics 2025-09-10 Seyed-Mohammad Bagheri