Skip to main content


eCommons@Cornell >
Cornell University Graduate School >
Cornell Theses and Dissertations >

Please use this identifier to cite or link to this item:
Title: Using Tree Automata to Investigate Intuitionistic Propositional Logic
Authors: O'Connor, Michael
Keywords: mathematics
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.
Appears in Collections:Cornell Theses and Dissertations

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