Back to search

Cornell University

Using Tree Automata to Investigate Intuitionistic Propositional Logic

Abstract

dc:description.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.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • O'Connor, Michael

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
6397064

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

O'Connor, Michael. Using Tree Automata to Investigate Intuitionistic Propositional Logic. 2008. https://hdl.handle.net/1813/11183