English
Related papers

Related papers: On generically stable types in dependent theories

200 papers

This work proposes a dependent type theory that combines functions and session-typed processes (with value dependencies) through a contextual monad, internalising typed processes in a dependently-typed lambda-calculus. The proposed…

Programming Languages · Computer Science 2018-01-25 Bernardo Toninho , Nobuko Yoshida

We describe a procedure to introduce general dependence structures on a set of random variables. These include order-$q$ moving average-type structures, as well as seasonal, periodic, spatial and spatio-temporal dependences. The invariant…

Statistics Theory · Mathematics 2021-10-15 Luis Nieto-Barajas , Eduardo Gutiérrez-Peña

This paper aims at developing model-theoretic tools to study interpretable fields and definably amenable groups, mainly in $\mathrm{NIP}$ or $\mathrm{NTP_2}$ settings. An abstract theorem constructing definable group homomorphisms from…

Logic · Mathematics 2025-01-07 Paul Z. Wang

We establish the rationality of the stable conjugation-invariant word norm on free groups and virtually free Coxeter groups.

Group Theory · Mathematics 2023-12-29 Henry Jaspars

We give an example of an NIP theory $T$ in which there is a formula that does not fork over $\varnothing$ but has measure $0$ under any global $\varnothing$-invariant Keisler measure, and we show that this cannot occur if $T$ is also…

Logic · Mathematics 2023-07-21 Anand Pillay , Atticus Stonestrom

Statistical independence is a notion ubiquitous in various fields such as in statistics, probability, number theory and physics. We establish the stability of independence for any pair of random variables by their corresponding Brockwell…

Probability · Mathematics 2024-04-12 Xingzhi Wang

The present paper gives a generalization of cartesian closed categories, called cartesian closed categories with dependence, whose strict version induces categories with families that support 1-, Sigma- and Pi-types in the strict sense.…

Category Theory · Mathematics 2019-02-26 Norihiro Yamada

We show that certain tilting results for quivers are formal consequences of stability, and as such are part of a formal calculus available in any abstract stable homotopy theory. Thus these results are for example valid over arbitrary…

Algebraic Topology · Mathematics 2016-03-02 Moritz Groth , Jan Stovicek

We introduce the notions of $rgs$ and $irgs$ as properties of a Keisler measure $\mu$, and prove that they are respectively equivalent to the existence of a generically stable random type that extends $\mu$ and to the fact that its…

Logic · Mathematics 2026-05-18 Karim Khanaki

For an affine algebra of nonexceptional type in the large rank we show the fermionic formula depends only on the attachment of the node 0 of the Dynkin diagram to the rest, and the fermionic formula of not type A can be expressed as a sum…

Quantum Algebra · Mathematics 2011-09-23 Masato Okado , Reiho Sakamoto

In the first part of the paper we study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories. Then we try to develop analogous theory for arbitrary dependent theories.

Logic · Mathematics 2011-02-19 Alf Onshuus , Alex Usvyatsov

We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…

Logic · Mathematics 2024-10-24 Daniel Max Hoffmann , Chieu-Minh Tran , Jinhe Ye

We give necessary and sufficient geometric conditions for a theory definable in an o-minimal structure to interpret a real closed field. The proof goes through an analysis of thorn-minimal types in super-rosy dependent theories of finite…

Logic · Mathematics 2007-11-02 Assaf Hasson , Alf Onshuus

Answering a special case of a question of Chernikov and Simon, we show that any non-dividing formula over a model M in a distal NIP theory is a member of a consistent definable family, definable over M.

Logic · Mathematics 2017-01-23 Gareth Boxall , Charlotte Kestner

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

In his paper \cite{MR1}, Markus Reineke proposed a conjecture that there exists a stable weight system $\Theta$ for every indecomposable representation of Dynkin type quiver. In this paper, we showed this conjecture is true for quivers of…

Representation Theory · Mathematics 2020-02-14 Pengfei Huang , Zhi Hu

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Logic in Computer Science · Computer Science 2023-11-28 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz , Szymon Toruńczyk

We prove that a theory $T$ has stable forking if and only if $T^\mathrm{eq}$ has stable forking.

Logic · Mathematics 2015-08-11 Enrique Casanovas , Joris Potier

This report is an extension of 'A Model of Parametric Dependent Type Theory in Bridge/Path Cubical Sets' (Nuyts, arXiv:1706.04383). The purpose of this text is to prove all technical aspects of our model for dependent type theory with…

Logic in Computer Science · Computer Science 2018-05-23 Andreas Nuyts

The $NFI$-topology, introduced in [S0], is a topology on the Stone space of a theory $T$ that depends on a reduct $T^-$ of $T$. This topology has been used in [S0] to describe the set of universal transducers for $(T,T^-)$ (invariants sets…

Logic · Mathematics 2020-02-18 Ziv Shami