- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the existence of indiscernible trees
Annals of Pure and Applied Logic 163 (12):1891-1902 (2012)
Abstract
We introduce several concepts concerning the indiscernibility of trees. A tree is by definition an ordered set such that, for any a∈O, the initial segment {b∈O:bOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.
Large cardinals and iteration trees of height ω.Alessandro Andretta - 1991 - Annals of Pure and Applied Logic 54 (1):1-15.
On the existence of regular types.Saharon Shelah & Steven Buechler - 1989 - Annals of Pure and Applied Logic 45 (3):277-308.
Trees and -subsets of ω1ω1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
Finite Tree Property for First-Order Logic with Identity and Functions.Merrie Bergmann - 2005 - Notre Dame Journal of Formal Logic 46 (2):173-180.
A special class of almost disjoint families.Thomas E. Leathrum - 1995 - Journal of Symbolic Logic 60 (3):879-891.
A blend of methods of recursion theory and topology: A Π1 0 tree of shadow points. [REVIEW]Iraj Kalantari & Larry Welch - 2004 - Archive for Mathematical Logic 43 (8):991-1008.
Mycielski among trees.Marcin Michalski, Robert Rałowski & Szymon Żeberski - 2021 - Mathematical Logic Quarterly 67 (3):271-281.
The isomorphism problem for ω-automatic trees.Dietrich Kuske, Jiamou Liu & Markus Lohrey - 2013 - Annals of Pure and Applied Logic 164 (1):30-48.
Analytics
Added to PP
2013-12-12
Downloads
268 (#100,445)
6 months
5 (#1,042,355)
2013-12-12
Downloads
268 (#100,445)
6 months
5 (#1,042,355)
Historical graph of downloads
Citations of this work
On model-theoretic tree properties.Artem Chernikov & Nicholas Ramsey - 2016 - Journal of Mathematical Logic 16 (2):1650009.
Tree indiscernibilities, revisited.Byunghan Kim, Hyeung-Joon Kim & Lynn Scow - 2014 - Archive for Mathematical Logic 53 (1-2):211-232.
Indiscernibles, EM-Types, and Ramsey Classes of Trees.Lynn Scow - 2015 - Notre Dame Journal of Formal Logic 56 (3):429-447.
Dense codense predicates and the NTP 2.Alexander Berenstein & Hyeung-Joon Kim - 2016 - Mathematical Logic Quarterly 62 (1-2):16-24.
On the antichain tree property.JinHoo Ahn, Joonhee Kim & Junguk Lee - 2022 - Journal of Mathematical Logic 23 (2).
References found in this work
Notions around tree property 1.Byunghan Kim & Hyeung-Joon Kim - 2011 - Annals of Pure and Applied Logic 162 (9):698-709.
Lascar strong types in some simple theories.Steven Buechler - 1999 - Journal of Symbolic Logic 64 (2):817-824.
A Supersimple Nonlow Theory.Enrique Casanovas & Byunghan Kim - 1998 - Notre Dame Journal of Formal Logic 39 (4):507-518.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-fcc9b7db9-hnclb uwo