Computer Science – Logic in Computer Science
Scientific paper
2008-12-28
Computer Science
Logic in Computer Science
3 pages
Scientific paper
Nominalistic Logic (NL) is a new presentation of Paul Gilmore's Intensional Type Theory (ITT) as a sequent calculus together with a succinct nominalization axiom (N) that permits names of predicates as individuals in certain cases. The logic has a flexible comprehension axiom, but no extensionality axiom and no infinity axiom, although axiom N is the key to the derivation of Peano's postulates for the natural numbers.
No associations
LandOfFree
Nominalistic Logic (Extended Abstract) 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 Nominalistic Logic (Extended Abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nominalistic Logic (Extended Abstract) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-478254