Jensen's Σ* theory and the combinatorial content of V = L

Journal of Symbolic Logic 59 (3):1096 - 1104 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275930

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

My notes

Similar books and articles

Incompatible extensions of combinatorial functions.Erik Ellentuck - 1983 - Journal of Symbolic Logic 48 (3):752-755.
Measurable cardinals and a combinatorial principle of Jensen.Keith J. Devlin - 1973 - Journal of Symbolic Logic 38 (4):551-560.
A descriptive view of combinatorial group theory.Simon Thomas - 2011 - Bulletin of Symbolic Logic 17 (2):252-264.
Some nonstandard methods in combinatorial number theory.Steven C. Leth - 1988 - Studia Logica 47 (3):265 - 278.
A strengthening of Jensen's □ principles.Aaron Beller & Ami Litman - 1980 - Journal of Symbolic Logic 45 (2):251-264.
Hyper-Torre isols.Erik Ellentuck - 1981 - Journal of Symbolic Logic 46 (1):1-5.
A partial model of NF with E.N. Prati - 1994 - Journal of Symbolic Logic 59 (4):1245 - 1253.
Some combinatorial and algorithmic problems in many-valued logics.Ivan Stojmenović - 1987 - Novi Sad: University of Novi Sad, Faculty of Science, Institute of Mathematics.
A combinatorial forcing for coding the universe by a real when there are no sharps.Saharon Shelah & Lee J. Stanley - 1995 - Journal of Symbolic Logic 60 (1):1-35.

Analytics

Added to PP
2009-01-28

Downloads
30 (#504,503)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Smooth categories and global □.Ronald B. Jensen & Martin Zeman - 2000 - Annals of Pure and Applied Logic 102 (1-2):101-138.
A simpler proof of Jensen's coding theorem.Sy D. Friedman - 1994 - Annals of Pure and Applied Logic 70 (1):1-16.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Some applications of almost disjoint forcing.R. B. Jensen & R. M. Solovay - 1970 - In Yehoshua Bar-Hillel (ed.), Mathematical Logic and Foundations of Set Theory. Amsterdam: North-Holland Pub. Co..

Add more references