If a boolean lattice has ACC how can we prove that it is finite?
I thought of the proof was 1. B has ACC 2. B has bottom 3. B is complete from 1 & 2
I am not sure how to proceed from here. Any suggestions ?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
0
|
||||||
|
closed as too localized by Bill Johnson, André Henriques, Mark Sapir, Joel David Hamkins, Todd Trimble Nov 15 2010 at 21:29 |
