Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-25T17:32:56.461Z Has data issue: false hasContentIssue false
  • English
  • Français

Invisible genericity and 0#

Published online by Cambridge University Press:  12 March 2014

M. C. Stanley
M. C. Stanley*
Affiliation:
Math Department, San Jose State, San Jose, Ca 95192 E-mail:stanley@math.sjsu.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

0# can be invisibly class generic.

Keywords

class forcingzero sharp
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 63 , Issue 4 , December 1998 , pp. 1297 - 1318
Copyright
Copyright © Association for Symbolic Logic 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Barwise, Jon, Admissible sets and structures, Perspectives in Mathematical Logic, Springer-Verlag, New York, 1975.Google Scholar
[2] Friedman, Harvey, Countable models of set theory, Cambridge summer school in mathematical logic, Lecture Notes in Mathematics, no. 337, Springer-Verlag, New York, 1973, pp. 539—573.CrossRefGoogle Scholar
[3] Friedman, Sy, The genericity conjecture, this Journal, vol. 59 (1994), pp. 606—614.Google Scholar
[4] Stanley, M. C., A non-generic real incompatible with 0#, Annals of Pure and Applied Logic, to appear.Google Scholar