Sciweavers

15 search results - page 1 / 3
» Forcing properties of ideals of closed sets
Sort
View
JSYML
2011
89views more  JSYML 2011»
12 years 8 months ago
Forcing properties of ideals of closed sets
With every σ-ideal I on a Polish space we associate the σ-ideal I∗ generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals...
Marcin Sabok, Jindrich Zapletal
MLQ
2008
106views more  MLQ 2008»
13 years 5 months ago
A general Mitchell style iteration
We work out the details of a schema for a mixed support forcing iteration, which generalizes the Mitchell model [7] with no Aronszajn trees on 2. The main purpose of this paper is ...
John Krueger
CSFW
1998
IEEE
13 years 9 months ago
Honest Ideals on Strand Spaces
In security protocol analysis, it is important to learn general principles that limit the abilities of an attacker, and that can be applied repeatedly to a variety of protocols. W...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
JSYML
1998
61views more  JSYML 1998»
13 years 4 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 5 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee