English
Related papers

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

200 papers

The space of Lascar strong types, on some sort and relative to a given first order theory T, is in general not a compact Hausdorff space. This paper has at least three aims. First to show that spaces of Lascar strong types and other related…

Logic · Mathematics 2012-04-17 Krzysztof Krupinski , Anand Pillay , Slawomir Solecki

This is an exposition a theorem of mathematical logic which only assumes the notions of structure, elementary equivalence, and compactness (saturation). Newelski proved that type-definable Lascar strong types have finite diameter. Our…

Logic · Mathematics 2016-05-03 Domenico Zambella

We apply compact group theory to obtain some model-theoretic results about the relativized Lascar Galois group of a strong type.

Logic · Mathematics 2023-11-14 Jan Dobrowolski , Byunghan Kim , Alexei Kolesnikov , Junguk Lee

A type analysable in one-based types in a simple theory is itself one-based.

Logic · Mathematics 2019-04-15 Frank Olaf Wagner

Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…

Logic · Mathematics 2015-03-17 Predrag Tanović

We show that if the restriction of the Lascar equivalence relation to a KP-strong type is non-trivial, then it is non-smooth (when viewed as a Borel equivalence relation on an appropriate space of types).

Logic · Mathematics 2017-05-17 Itay Kaplan , Benjamin Miller , Pierre Simon

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Logic · Mathematics 2023-07-10 Djamel Eddine Amir , Mathieu Hoyrup

A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.

Logic · Mathematics 2013-02-18 Colin McLarty

In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…

Logic · Mathematics 2009-06-18 Moran Cohen , Saharon Shelah

We study Kim-independence over arbitrary sets. Assuming that forking satisfies existence, we establish Kim's lemma for Kim-dividing over arbitrary sets in an NSOP$_{1}$ theory. We deduce symmetry of Kim-independence and the independence…

Logic · Mathematics 2019-09-19 Jan Dobrowolski , Byunghan Kim , Nicholas Ramsey

We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the…

Logic in Computer Science · Computer Science 2015-07-01 Benjamin Werner

In this paper we study the Lascar group over a hyperimaginary e. We verify that various results about the group over a real set still hold when the set is replaced by e. First of all, there is no written proof in the available literature…

Logic · Mathematics 2024-08-13 Byunghan Kim , Hyoyoon Lee

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

Logic in Computer Science · Computer Science 2015-03-17 Christoph Benzmueller

We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…

Logic in Computer Science · Computer Science 2007-05-23 M. Dezani-Ciancaglini , S. Lusin

We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.

Logic · Mathematics 2016-05-20 B. van den Berg , E. M. Briseid , P. Safarik

We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of $NIP$ (not the independence property), continuing aspects of math.LO/0607442. Among key results are: (i) if $p = tp(b/A)$ does not fork…

Logic · Mathematics 2009-01-29 Ehud Hrushovski , Anand Pillay

We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain…

Logic · Mathematics 2013-08-14 Itaï Ben Yaacov , Artem Chernikov

We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…

Logic · Mathematics 2016-05-12 Alfred Dolich , John Goodrick

In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.

Rings and Algebras · Mathematics 2009-09-25 Byunghan Kim

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…

Logic · Mathematics 2018-04-18 Daniel Palacín , Saharon Shelah
‹ Prev 1 2 3 10 Next ›