It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
We investigate three intermediate logics and their modal counterparts that play an important role in the study of modal logics of forcing classes. Hamkins, Leibman and Löwe have conjectured that S4.tBAis an upper bound of the modal logic of c.c.c. forcing; Inamdar has proved that S4.sBAis such an up-per bound; in Chapter 3 of our thesis, we prove under additional assumptions that S4.FPFA, a modal logic that is contained in the intersection of the two other logics, is an upper bound. We do not know whether our additional assumptions are true; if so, our result proves the conjecture by Hamkins, Leibman and Löwe.
The remaining chapters of the thesis study the six mentioned logics in more detail. In Chapter 4 we prove two conjectures by Nick Bezhanishvili on generalized Medvedev logics; in Chapter 5 we connect the concept of nerve to Medvedev logic; in Chapter 6 we prove that S4.SBAis not finitely axiomatisable over Cheq; and finally, in Chapter 7 we prove that Cheqis not axiomatisable with five or six variables.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer