Games on Boolean algebra

eBiblioteka

 
 

Games on Boolean algebra

Show simple item record

dc.contributor.advisor Kurilić, Miloš
dc.contributor.author Šobot, Boris en_US
dc.date.accessioned 2009-12-03T12:19:23Z
dc.date.available 2009-12-03T12:19:23Z
dc.date.issued 2009
dc.identifier.uri http://hdl.handle.net/123456789/297
dc.description.abstract The method of forcing is widely used in set theory to obtain various consistency proofs. Complete Boolean algebras play the main role in applications of forcing. Therefore it is useful to define games on Boolean algebras that characterize their properties important for the method. The most investigated game is Jech’s distributivity game, such that the first player has the winning strategy iff the algebra is not (!, 2)-distributive. We define another game characterizing the collapsing of the continuum to !, prove several sufficient conditions for the second player to have a winning strategy, and obtain a Boolean algebra on which the game is undetermined. en
dc.description.provenance Made available in DSpace on 2009-12-03T12:19:23Z (GMT). No. of bitstreams: 1 phdBorisSobot.pdf: 987622 bytes, checksum: a0b6fbfc9e392be4016d894cfc2c2ea2 (MD5) en
dc.format.extent 114
dc.publisher Novi Sad en_US
dc.title Games on Boolean algebra en_US
mf.subject.keywords Boolean algebras, partial orders, games, forcing en
mf.contributor.committee Grulović, Milan; Pilipović, Stevan; Mijajlović, Žarko

Files in this item

Files Size Format View
phdBorisSobot.pdf 987.6Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record