English
Related papers

Related papers: An Intuitionistic Set-theoretical Model of Fully D…

200 papers

Many interpretable AI approaches have been proposed to provide plausible explanations for a model's decision-making. However, configuring an explainable model that effectively communicates among computational modules has received less…

Machine Learning · Computer Science 2023-11-09 Jinyung Hong , Keun Hee Park , Theodore P. Pavlic

We call a monoidal category ${\mathcal C}$ a Serre category if for any $C$, $D \in {\mathcal C}$ such that $C\ot D$ is semisimple, $C$ and $D$ are semisimple objects in ${\mathcal C}$. Let $H$ be an involutory Hopf algebra, $M$, $N$ two…

Rings and Algebras · Mathematics 2014-03-18 G. Militaru

Levin-Wen models are a class of two-dimensional lattice spin models with a Hamiltonian that is a sum of commuting projectors, which describe topological phases of matter related to Drinfeld centres. We generalise this construction to…

Strongly Correlated Electrons · Physics 2023-09-13 Vincentas Mulevicius , Ingo Runkel , Thomas Voß

We extend some classical constructions in commutative algebra to the setting of modules over orders in (non-commutative) semisimple algebras. Our theory incorporates, inter alia, `reduced' versions of the notions of higher Fitting…

Number Theory · Mathematics 2025-09-16 David Burns , Takamichi Sano

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

Logic in Computer Science · Computer Science 2026-03-16 Yunsong Yang , Simon Guilloud , Viktor Kunčak

We prove an implicit function theorem for Keller C^k_c-maps from arbitrary real or complex topological vector spaces to Frechet spaces, imposing only a certain metric estimate on the partial differentials. As a tool, we show the…

Functional Analysis · Mathematics 2007-05-23 Helge Glockner

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…

Logic in Computer Science · Computer Science 2015-07-01 Gyesik Lee , Benjamin Werner

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

Free independence is an important tool for studying the structure of operator algebras. It is natural to ask from the model-theoretic standpoint whether free independence is captured well in first-order model theory via the notion of a…

Operator Algebras · Mathematics 2026-02-25 William Boulanger , Jakub Curda , Emma Harvey , Yizhi Li , Jennifer Pi

The non-bijective version of Wigner's theorem states that a map which is defined on the set of self-adjoint, rank-one projections (or pure states) of a complex Hilbert space and which preserves the transition probability between any two…

Mathematical Physics · Physics 2014-07-03 Gy. P. Gehér

Recent years have seen a growing interest in methods for predicting an unknown variable of interest, such as a subject's diagnosis, from medical images depicting its anatomical-functional effects. Methods based on discriminative modeling…

Computer Vision and Pattern Recognition · Computer Science 2024-10-14 Chiara Mauri , Stefano Cerri , Oula Puonti , Mark Mühlau , Koen Van Leemput

In most contemporary approaches to decision making, a decision problem is described by a sets of states and set of outcomes, and a rich set of acts, which are functions from states to outcomes over which the decision maker (DM) has…

Computer Science and Game Theory · Computer Science 2021-09-07 Lawrence Blume , David Easley , Joseph Y. Halpern

Reynold's abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions…

Logic in Computer Science · Computer Science 2012-09-28 Chantal Keller , Marc Lasson

Given a reference model that includes all the available variables, projection predictive inference replaces its posterior with a constrained projection including only a subset of all variables. We extend projection predictive inference to…

Computation · Statistics 2021-09-13 Alejandro Catalina , Paul Bürkner , Aki Vehtari

Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…

Logic in Computer Science · Computer Science 2014-06-03 Arno Pauly , Matthew de Brecht

The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos…

Category Theory · Mathematics 2015-08-27 David Michael Roberts

This paper presents a topological learning-theoretic perspective on causal inference by introducing a series of topologies defined on general spaces of structural causal models (SCMs). As an illustration of the framework we prove a…

Artificial Intelligence · Computer Science 2022-06-01 Duligur Ibeling , Thomas Icard

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

Logic · Mathematics 2007-05-23 Wilfrid Hodges , Saharon Shelah

The universal C*-algebras of discrete product systems generalize the Toeplitz- Cuntz algebras and the Toeplitz algebras of discrete semigroups. We consider a semigroup P which is quasi-lattice ordered in the sense of Nica, and, for a…

Operator Algebras · Mathematics 2007-05-23 Neal J. Fowler

Concept-based interpretability methods offer a lens into the internals of foundation models by decomposing their embeddings into high-level concepts. These concept representations are most useful when they are compositional, meaning that…

Computation and Language · Computer Science 2024-06-27 Adam Stein , Aaditya Naik , Yinjun Wu , Mayur Naik , Eric Wong