Related papers: A note on Lascar strong types in simple theories

This note gives a unifying characterization and exposition of strongly irreducible elements and their duals in lattices. The interest in the study of strong irreducibility stems from commutative ring theory, while the dual concept of strong…

We present another proof for the well-known {\em small model property} of two-variable logic. As far as we know, existing proofs of this property rely heavily on model theoretic concepts. In contrast, ours is purely combinatorial and uses…

In the paper it is proven that Carter subgroups of a finite group are conjugate. A complete classification of Carter subgroups in finite almost simple groups is also obtained.

It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement…

For a rosy theory, we give a canonical surjective homomorphism from a Lascar group over $A=\acl^{eq}(A)$ to a first homology group of a strong type over $A$, and we describe its kernel by an invariant equivalence relation. As a consequence,…

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…

We prove a new theorem on additive Levy processes and show that this theorem implies several proved theorems and a hard conjectured theorem.

We propose an extension of pure type systems with an algebraic presentation of inductive and co-inductive type families with proper indices. This type theory supports coercions toward from smaller sorts to bigger sorts via explicit type…

The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…

We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown…

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

We prove a Khintchine type theorem for approximation of elements in the Cantor set, as a subset of the formal Laurent series over $\mathbb{F}_3$, by rational functions of a specific type. Furthermore we construct elements in the Cantor set…

Strong monads are important for several applications, in particular, in the denotational semantics of effectful languages, where strength is needed to sequence computations that have free variables. Strength is non-trivial: it can be…

We introduce the Delta-framework, LF-Delta, a dependent type theory based on the Edinburgh Logical Framework LF, extended with the strong proof-functional connectives, i.e. strong intersection, minimal relevant implication and strong union.…

Let $p$ be a strong type of an algebraically closed tuple over $B=\acl^{\eq}(B)$ in any theory $T$. Depending on a ternary relation $\indo^*$ satisfying some basic axioms (there is at least one such, namely the trivial independence in $T$),…

In this short note we report on results on a computational search for a counterexample to the strong coincidence conjecture. In particular, we discuss the method used so that further searches can be conducted.

In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…

First, we show that a compact object $C$ in a triangulated category, which satisfies suitable conditions, induces a $t$-structure. Second, in an abelian category we show that a complex $P^{\centerdot}$ of small projective objects of term…

We prove in particular that, in a large class of dp-minimal theories including the p-adics, definable types are dense amongst non-forking types.

We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch…