2 citations · 3 across the 8 of their papers we have counts for
6 papers · 1 filter
A Busy Beaver Problem for Infinite-Time Turing Machines
James T. Long, Lee J. Stanley
This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning…
Consistency of partition relation for cardinal in (lambda,2^lambda)
Saharon Shelah, Lee Stanley
We present a forcing for blowing up 2^lambda and making ``many positive polarized partition relations'' (in a sense made precise in (c) of our main theorem) hold in the interval [l…
Ideals, Cohen sets and consistent extensions of the Erdős-Dushnik-Miller Theorem
Saharon Shelah, Lee Stanley
We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limi…
The combinatorics of combinatorial coding by a real
Saharon Shelah, Lee Stanley
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result…
A combinatorial forcing for coding the universe by a real when there are no sharps
Saharon Shelah, Lee Stanley
Assuming 0# does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the…
Coding and reshaping when there are no sharps
Saharon Shelah, Lee Stanley
Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-codi…