Positive indiscernibles

Archive for Mathematical Logic:1-20 (forthcoming)
  Copy   BIBTEX

Abstract

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$$_0$$ 0 -trees (the reduct of str-trees that forgets the length comparison relation) and arrays. In doing so, we prove stronger versions for basing—rather than locally basing or EM-basing—str-trees on s-trees and str$$_0$$ 0 -trees on str-trees. As an application we show that a thick positive theory has k-$$\mathsf {TP_2}$$ TP 2 iff it has 2-$$\mathsf {TP_2}$$ TP 2.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Around accumulation points and maximal sequences of indiscernibles.Moti Gitik - forthcoming - Archive for Mathematical Logic:1-18.
Partitions of trees and $${{\sf ACA}^\prime_{0}}$$.Bernard A. Anderson & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (3-4):227-230.
Erratum: “Forcing and antifoundation”. [REVIEW]Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):663-663.
Well-foundedness in Realizability.M. Hofmann, J. Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.
Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.
Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.
On superstable generic structures.Koichiro Ikeda & Hirotaka Kikyo - 2012 - Archive for Mathematical Logic 51 (5):591-600.
A note on the schemes of replacement and collection.A. R. D. Mathias - 2007 - Archive for Mathematical Logic 46 (1):43-50.
Overspill and fragments of arithmetic.C. Dimitracopoulos - 1989 - Archive for Mathematical Logic 28 (3):173-179.

Analytics

Added to PP
2024-05-12

Downloads
1 (#1,911,041)

6 months
1 (#1,512,999)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Positive model theory and compact abstract theories.Itay Ben-Yaacov - 2003 - Journal of Mathematical Logic 3 (01):85-118.
Positive Jonsson Theories.Bruno Poizat & Aibat Yeshkeyev - 2018 - Logica Universalis 12 (1-2):101-127.
Simplicity in compact abstract theories.Itay Ben-Yaacov - 2003 - Journal of Mathematical Logic 3 (02):163-191.
On ◁∗-maximality.Mirna Džamonja & Saharon Shelah - 2004 - Annals of Pure and Applied Logic 125 (1-3):119-158.
Tree indiscernibilities, revisited.Byunghan Kim, Hyeung-Joon Kim & Lynn Scow - 2014 - Archive for Mathematical Logic 53 (1-2):211-232.

View all 14 references / Add more references