中文
相关论文

相关论文: Dependent theories and the generic pair conjecture

200 篇论文

We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of information theoretic quantities from data uncovers…

定量方法 · 定量生物学 2007-07-13 Ilya Nemenman

This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…

逻辑 · 数学 2009-09-25 John T. Baldwin , Saharon Shelah

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…

逻辑 · 数学 2015-09-24 Pierre Simon

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

逻辑 · 数学 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

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…

计算机科学中的逻辑 · 计算机科学 2026-05-07 Matthijs Vákár

We study invariant types in NIP theories. Amongst other things: we prove a definable version of the (p,q)-theorem in theories of small or medium directionality; we construct a canonical retraction from the space of M-invariant types to that…

逻辑 · 数学 2015-11-10 Pierre Simon

We prove that any type in an NIP theory can be decomposed into a stable part (a generically stable partial type) and a distal-like quotient.

逻辑 · 数学 2017-08-03 Pierre Simon

This paper proposes a new setup for studying pairs of structures. This new framework includes many of the previously studied classes of pairs, such as dense pairs of o-minimal structures, lovely pairs, fields with Mann groups, and…

逻辑 · 数学 2020-01-17 Alexi Block Gorman , Philipp Hieronymi , Elliot Kaplan

Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…

范畴论 · 数学 2016-07-26 Valery Isaev

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…

逻辑 · 数学 2018-04-18 Daniel Palacín , Saharon Shelah

We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Khalil Djelloul

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

计算机科学中的逻辑 · 计算机科学 2024-01-30 C. B. Aberlé

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…

计算机科学中的逻辑 · 计算机科学 2026-03-16 Yunsong Yang , Simon Guilloud , Viktor Kunčak

We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…

逻辑 · 数学 2013-03-15 Lynn Scow

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

组合数学 · 数学 2009-09-25 Jonathan David Farley

We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…

Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…

代数几何 · 数学 2013-02-14 Tsemo Aristide

We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a $\pmb\Pi_\omega^0$-complete set of models. In…

逻辑 · 数学 2025-03-17 Uri Andrews , David Gonzalez , Steffen Lempp , Dino Rossegger , Hongyu Zhu

The paper discusses from a metaphysical standpoint the nature of the dependence relation underpinning the talk of mutual action between material and spatiotemporal structures in general relativity. It is shown that the standard analyses of…

物理学史与哲学 · 物理学 2019-10-11 Antonio Vassallo

We consider profinite groups as 2-sorted first order structures, with a group sort, and a second sort which acts as an index set for a uniformly definable basis of neighbourhoods of the identity. It is shown that if the basis consists of…

逻辑 · 数学 2017-05-17 Dugald Macpherson , Katrin Tent