Computer Science – Logic in Computer Science
Scientific paper
2010-04-12
LMCS 6 (2:4) 2010
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-6(2:4)2010
We study simple type theory with primitive equality (STT) and its first-order fragment EFO, which restricts equality and quantification to base types but retains lambda abstraction and higher-order variables. As deductive system we employ a cut-free tableau calculus. We consider completeness, compactness, and existence of countable models. We prove these properties for STT with respect to Henkin models and for EFO with respect to standard models. We also show that the tableau system yields a decision procedure for three EFO fragments.
Brown Chad E.
Smolka Gert
No associations
LandOfFree
Analytic Tableaux for Simple Type Theory and its First-Order Fragment 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 Analytic Tableaux for Simple Type Theory and its First-Order Fragment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analytic Tableaux for Simple Type Theory and its First-Order Fragment will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-262676