Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A simple tree lemma and its application to a counterexample of philips

A simple tree lemma and its application to a counterexample of philips We prove a tree lemma on perfect trees to obtain an ultrafilter of definable subsets of ℕ, which is Ramsey but not conservative (see [Phi 2]). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

A simple tree lemma and its application to a counterexample of philips

Archive for Mathematical Logic , Volume 18 (1) – Jul 13, 2005

Loading next page...
 
/lp/springer-journals/a-simple-tree-lemma-and-its-application-to-a-counterexample-of-philips-6MSRi0T3MZ

References (3)

Publisher
Springer Journals
Copyright
Copyright © 1977 by Verlag W. Kohlhammer
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/BF02007258
Publisher site
See Article on Publisher Site

Abstract

We prove a tree lemma on perfect trees to obtain an ultrafilter of definable subsets of ℕ, which is Ramsey but not conservative (see [Phi 2]).

Journal

Archive for Mathematical LogicSpringer Journals

Published: Jul 13, 2005

There are no references for this article.