Skip to main content


eCommons@Cornell

eCommons@Cornell >
Cornell University Graduate School >
Theses and Dissertations (OPEN) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/11183
Title: Using Tree Automata to Investigate Intuitionistic Propositional Logic
Authors: O'Connor, Michael
Keywords: mathematics
logic
Issue Date: 30-Jul-2008
Abstract: Intuitionistic logic is an important variant of classical logic, but it is not as well-understood, even in the propositional case. In this thesis, we describe a faithful representation of intuitionistic propositional formulas as tree automata. This representation permits a number of consequences, including a characterization theorem for free Heyting algebras, which are the intutionistic analogue of free Boolean algebras, and a new algorithm for solving equations over intuitionistic propositional logic.
URI: http://hdl.handle.net/1813/11183
Appears in Collections:Theses and Dissertations (OPEN)

Files in This Item:

File Description SizeFormat
myThesis.pdf321.14 kBAdobe PDFView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us