VTechWorks staff will be away for the Thanksgiving holiday beginning at noon on Wednesday, November 27, through Friday, November 29. We will resume normal operations on Monday, December 2. Thank you for your patience.
 

Modal logics of provability

Simple item page
dc.contributor.authorPemmaraju, Sriram V.en
dc.contributor.committeechairRoach, John W.en
dc.contributor.committeememberHeath, Lenwood S.en
dc.contributor.committeememberCuda, Thomas V.en
dc.contributor.departmentComputer Science and Applicationsen
dc.date.accessioned2014-03-14T21:45:10Zen
dc.date.adate2012-09-08en
dc.date.available2014-03-14T21:45:10Zen
dc.date.issued1989-05-05en
dc.date.rdate2012-09-08en
dc.date.sdate2012-09-08en
dc.description.abstractGödel proved his Incompleteness theorems for any theory 'strong' enough to represent recursive functions. In the process he showed that the provability predicate can be represented in such theories. Modal logics of provability are modal logics which attempt to express the concept of 'provability' and 'consistency' using the modal operators '[]' and '<>' respectively. This is achieved by forcing '[]' to behave like the provability predicate. GL is a modal logic which has been shown to be complete and sound with respect to arithmetic theories (theories which can represent all recursive functions), hence results about concepts such as 'consistency,' 'provability' and 'decidability' in arithmetic theories can be stated and proved in GL. It has also been proved that GL is complete with respect to the class of finite, transitive, reversely well-founded models. This essentially means that the set of theorems of GL is recursive and hence there exists an effective procedure to determine whether a given wff is a theorem of GL or not. We investigate a weaker version of GL called GH and show that GH is not complete with respect to arithmetic theories. We show this by first showing that GH is a proper subset of GL and then showing that the theorems missing from GH are properties of the provability predicate. We finally, show that GH is not complete with respect to the class of transitive, reversely well-founded models and hence not sound and complete with respect to any frame.en
dc.description.degreeMaster of Scienceen
dc.format.extentv, 54 leavesen
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-09082012-040214en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-09082012-040214/en
dc.identifier.urihttp://hdl.handle.net/10919/44652en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V855_1989.P466.pdfen
dc.relation.isformatofOCLC# 20766584en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V855 1989.P466en
dc.subject.lcshLogic, Symbolic and mathematicalen
dc.titleModal logics of provabilityen
dc.typeThesisen
dc.type.dcmitypeTexten
thesis.degree.disciplineComputer Science and Applicationsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V855_1989.P466.pdf
Size:
2.48 MB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Masters Theses