Computer Science – Logic in Computer Science
Scientific paper
2010-01-22
Computer Science
Logic in Computer Science
11 pages
Scientific paper
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for denotational and deductive completeness. Denotational completeness means that every value of the full set-theoretic type hierarchy can be described by a closed term. Deductive completeness is shown for a sequent-based proof system that extends a propositional natural deduction system with lambda conversion and Boolean replacement.
Kaminski Mark
Smolka Gert
No associations
LandOfFree
A Minimal Propositional Type Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Minimal Propositional Type Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Minimal Propositional Type Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-656135