Show simple item record

dc.contributor.authorO'Connor, Michael
dc.date.accessioned2008-07-30T21:15:01Z
dc.date.available2008-07-30T21:15:01Z
dc.date.issued2008-07-30T21:15:01Z
dc.identifier.otherbibid: 6397064
dc.identifier.urihttps://hdl.handle.net/1813/11183
dc.description.abstractIntuitionistic 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.en_US
dc.language.isoen_USen_US
dc.subjectmathematicsen_US
dc.subjectlogicen_US
dc.titleUsing Tree Automata to Investigate Intuitionistic Propositional Logicen_US
dc.typedissertation or thesisen_US
dc.typedissertation or thesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics