English
Related papers

Related papers: A Higher Structure Identity Principle

200 papers

Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…

Logic in Computer Science · Computer Science 2024-12-18 C. B. Aberlé

We complete the determination of saturated fusion systems on maximal class 3-groups of rank two.

Group Theory · Mathematics 2019-01-24 Chris Parker , Jason Semeraro

Topological Structures in the Standard Model at high $T$ are discussed.

High Energy Physics - Theory · Physics 2007-05-23 R. Jackiw

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

Logic in Computer Science · Computer Science 2026-05-14 Neta Elad , Sharon Shoham

We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…

Combinatorics · Mathematics 2014-06-10 Jaroslav Nesetril , Patrice Ossona De Mendez

Parametricity is a property of the syntax of type theory implying, e.g., that there is only one function having the type of the polymorphic identity function. Parametricity is usually proven externally, and does not hold internally.…

Logic in Computer Science · Computer Science 2023-11-17 Thorsten Altenkirch , Yorgo Chamoun , Ambrus Kaposi , Michael Shulman

The idea that gauge theory has 'surplus' structure poses a puzzle: in one much discussed sense, this structure is redundant; but on the other hand, it is also widely held to play an essential role in the theory. In this paper, we employ…

History and Philosophy of Physics · Physics 2017-12-05 James Nguyen , Nicholas J. Teh , Laura Wells

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…

Probability · Mathematics 2025-06-24 Matthias Georg Mayer

We import ideas from geometry to settle Sarnak's saturation problem for a large class of algebraic varieties.

Number Theory · Mathematics 2018-03-12 Efthymios Sofos , Yuchao Wang

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

Logic · Mathematics 2026-04-29 Hongyu Zhu

We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…

Algebraic Topology · Mathematics 2018-10-02 Killian Meehan , Andrei Pavlichenko , Jan Segert

Statistical latent class models are widely used in social and psychological researches, yet it is often difficult to establish the identifiability of the model parameters. In this paper we consider the identifiability issue of a family of…

Methodology · Statistics 2016-03-15 Gongjun Xu

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

Logic in Computer Science · Computer Science 2020-10-28 Rafaël Bocquet

This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…

General Mathematics · Mathematics 2025-10-23 Joaquim Reizi Barreto

We study the saturation properties of several classes of $C^*$-algebras. Saturation has been shown by Farah and Hart to unify the proofs of several properties of coronas of $\sigma$-unital $C^*$-algebras; we extend their results by showing…

Logic · Mathematics 2015-10-08 Christopher J. Eagle , Alessandro Vignati

We define a `tree of fusion systems' and give a sufficient condition for its completion to be saturated. We apply this result to enlarge an arbitrary fusion system by extending the automorphism groups of certain of its subgroups.

Group Theory · Mathematics 2013-10-30 Jason P. G. Semeraro

In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider…

cmp-lg · Computer Science 2008-02-03 Dale Gerdemann , Paul John King

We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…

Logic in Computer Science · Computer Science 2026-01-27 Ruotong Cheng , Azadeh Farzan

This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path. By considering a particular gros topos,…

Logic in Computer Science · Computer Science 2023-06-22 Ian Orton , Andrew M. Pitts

The classical Liouville Theorem on conformal transformations determines local conformal transformations on the Euclidean space of dimension $\geq 3$. Its natural adaptation to the general framework of Riemannian structures is the 2-rigidity…

Differential Geometry · Mathematics 2017-01-10 Samir Bekkara , Abdelghani Zeghib