相关论文: A note on Lascar strong types in simple theories

Since physical theories employ mathematical models to describe and predict physical phenomena, our knowledge depends on the models available to that end. To increase their scope we present a particular type of simplified models, serial…

In this paper we construct a Beth model for intuitionistic functionals of high types and use it to create a relatively strong theory SLP containg intuitionistic principles for functionals, in particular, the theory of the "creating…

We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure we show that the semantics of various natural language…

First, we shall formulate and prove Theorem of Lie-Kolchin type for a cone and derive some algebro-geometric consequences. Next, inspired by a recent result of Dinh and Sibony we pose a conjecture of Tits type for a group of automorphisms…

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…

We introduce a notion of the ``explanation" of one (generalized) probabilistic model by another as particular kind of span in the category $\Prob$ of probabilistic models and morphisms. We show that explanations compose under a standard…

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…

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…

We study strong approximation for some algebraic varieties over which are defined using norm forms over the rationals. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg.

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

We investigate unital, subtractive and strongly unital regular categories with enough projectives and give characterizations of their projective covers. The categorical equation "strongly unital = unital + subtractive" is explored: this…

We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent (NIP) theories.

The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…

We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…

This article establishes a real-variable argument for Zygmund's theorem on almost everywhere convergence of strong arithmetic means of partial sums of Fourier series on $\mathbb{T}$, up to passing to a subsequence. Our approach extends to,…

We present the notions of positively complete theory and general forms of amalgamation in the framework of positive logic. We explore the fundamental properties of positively complete theories and study the behaviour of companion theories…

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…

The FKG theorem says that the POSITIVE LATTICE CONDITION, an easily checkable hypothesis which holds for many natural families of events, implies POSITIVE ASSOCIATION, a very useful property. Thus there is a natural and useful theory of…