English
Related papers

Related papers: Boolean Types in Dependent Theories

200 papers

We scale layered modal type theory to dependent types, introducing DeLaM, dependent layered modal type theory. This type theory is novel in that we have one uniform type theory in which we can not only compose and execute code, but also…

Logic in Computer Science · Computer Science 2024-07-09 Jason Z. S. Hu , Brigitte Pientka

We prove some results about the theory of independence in $\mathrm{NSOP}_{3}$ theories that do not hold in $\mathrm{NSOP}_{4}$ theories. We generalize Chernikov's work on simple and co-simple types in $\mathrm{NTP}_{2}$ theories to types…

Logic · Mathematics 2026-05-29 Scott Mutchnik

We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…

Logic · Mathematics 2025-02-28 Alexander Usvyatsov

We give examples of (i) a simple theory with a formula (with parameters) which does not fork over the empty set but has mu measure 0 for every automorphism invariant Keisler measure mu, and (ii) a definable group G in a simple theory such…

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

The paper investigates possible generalisations of Maharam's theorem to a classification of Boolean algebras that support a finitely additive measure. We prove that Boolean algebras that support a finitely additive non-atomic uniformly…

Logic · Mathematics 2011-05-09 Piotr Borodulin-Nadzieja , Mirna Džamonja

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

Combinatorics · Mathematics 2011-11-15 Hamed Hatami

We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…

Programming Languages · Computer Science 2026-05-20 Maximilian Doré

Measuring the dependence of data plays a central role in statistics and machine learning. In this work, we summarize and generalize the main idea of existing information-theoretic dependence measures into a higher-level perspective by the…

Machine Learning · Computer Science 2021-01-26 Shujian Yu , Francesco Alesiani , Xi Yu , Robert Jenssen , Jose C. Principe

We present distributions of countable models and correspondent structural characteristics of complete theories with continuum many types: for prime models over finite sets relative to Rudin-Keisler preorders, for limit models over types and…

Logic · Mathematics 2012-10-16 Roman A. Popkov , Sergey V. Sudoplatov

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Programming Languages · Computer Science 2025-10-08 Qiancheng Fu , Hongwei Xi

Known and new results on free Boolean topological groups are collected. An account of properties which these groups share with free or free Abelian topological groups and properties specific of free Boolean groups is given. Special emphasis…

General Topology · Mathematics 2016-12-16 Ol'ga Sipacheva

It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed…

Logic in Computer Science · Computer Science 2023-03-31 Steve Awodey , Florian Rabe

The Noisy-Or model is convenient for describing a class of uncertain relationships in Bayesian networks [Pearl 1988]. Pearl describes the Noisy-Or model for Boolean variables. Here we generalize the model to nary input and output variables…

Artificial Intelligence · Computer Science 2013-03-08 Sampath Srinivas

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

In this paper we develop a notion of measure theory over boolean toposes which is analogous to noncommutative measure theory, i.e. to the theory of von Neumann algebras. This is part of a larger project to study relations between topos…

Category Theory · Mathematics 2016-09-07 Simon Henry

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

This paper develops an intuitive concept of perfect dependence between two variables of which at least one has a nominal scale. Perfect dependence is attainable for all marginal distributions. It furthermore proposes a set of dependence…

Methodology · Statistics 2026-02-05 Jan-Lukas Wermuth

A flexible representation of uncertainty that remains within the standard framework of probabilistic measure theory is presented along with a study of its properties. This representation relies on a specific type of outer measure that is…

Information Theory · Computer Science 2016-11-10 Jeremie Houssineau , Daniel E. Clark