- 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
Forcing Minimal Degree of Constructibility
Journal of Symbolic Logic 56 (3):769 (1991)
Abstract
In this paper we will study four forcing notions, two of them giving a minimal degree of constructibility. These constructions give answers to questions in [Ih].Other 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
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Review: Moti Gitik, Saharon Shelah, Forcings with ideals and simple forcing notions; M. Gitik, S. Shelah, More on simple forcing Notions and forcing with ideals; D. H. Fremin, Real-valued-measurable cardinals. [REVIEW]Maxim R. Burke - 1995 - Journal of Symbolic Logic 60 (3):1022-1024.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.
Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree.Brooke M. Andersen & Marcia J. Groszek - 2009 - Notre Dame Journal of Formal Logic 50 (2):195-200.
An Overview of Saharon Shelah's Contributions to Mathematical Logic, in Particular to Model Theory.Jouko Väänänen - 2020 - Theoria 87 (2):349-360.
A Minimal Set Low for Speed.Rod Downey & Matthew Harrison-Trainor - 2022 - Journal of Symbolic Logic 87 (4):1693-1728.
Shelah Saharon. Proper and improper forcing. Second edition of JSL L 237. Perspectives in mathematical logic. Springer, Berlin, Heidelberg, New York, etc., 1998, xlvii + 1020 pp. [REVIEW]Péter Komjáath - 2000 - Bulletin of Symbolic Logic 6 (1):83-86.
Saharon Shelah. Proper forcing. Lecture notes in mathematics, vol. 940. Springer-Verlag, Berlin, Heidelberg, and New York, 1982, xxix + 496 pp. [REVIEW]S. Todorcevic - 1985 - Journal of Symbolic Logic 50 (1):237-239.
Analytics
Added to PP
2009-01-28
Downloads
42 (#532,324)
6 months
11 (#345,260)
2009-01-28
Downloads
42 (#532,324)
6 months
11 (#345,260)
Historical graph of downloads
Citations of this work
Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Combinatorics and forcing with distributive ideals.Pierre Matet - 1997 - Annals of Pure and Applied Logic 86 (2):137-201.
References found in this work
There may be simple Pℵ1 and Pℵ2-points and the Rudin-Keisler ordering may be downward directed.Andreas Blass & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):213-243.
Selective ultrafilters and homogeneity.Andreas Blass - 1988 - Annals of Pure and Applied Logic 38 (3):215-255.
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-54ff658c48-6hqvk uwo