JavaScript is disabled for your browser. Some features of this site may not work without it.
Using Tree Automata to Investigate Intuitionistic Propositional Logic

Author
O'Connor, Michael
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.
Date Issued
2008-07-30Subject
mathematics; logic
Type
dissertation or thesis