Sciweavers

MLQ
2006
86views more  MLQ 2006»
13 years 11 months ago
Calculus on strong partition cardinals
James M. Henle
MLQ
2006
92views more  MLQ 2006»
13 years 11 months ago
The strength of sharply bounded induction
We prove that the sharply bounded arithmetic T0 2 in a language containing the function symbol x
Emil Jerábek
MLQ
2006
93views more  MLQ 2006»
13 years 11 months ago
On the extender algebra being complete
We show that a Woodin cardinal is necessary for the Extender Algebra to be complete. Our proof is relatively simple and does not use fine structure.
Richard Ketchersid, Stuart Zoble
MLQ
2006
68views more  MLQ 2006»
13 years 11 months ago
Envelopes, indicators and conservativeness
Andrés Cordón-Franco, Alejandro Fern...
MLQ
2006
84views more  MLQ 2006»
13 years 11 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen
MLQ
2006
65views more  MLQ 2006»
13 years 11 months ago
The ultra-weak Ash conjecture and some particular cases
Annie Chateau, Malika More
MLQ
2006
77views more  MLQ 2006»
13 years 11 months ago
How much sweetness is there in the universe?
Abstract. We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topolog...
Andrzej Roslanowski, Saharon Shelah
MLQ
2006
63views more  MLQ 2006»
13 years 11 months ago
Counting as integration in feasible analysis
Fernando Ferreira, Gilda Ferreira