Nominalistic Logic (Extended Abstract)
Logic in Computer Science
2008-12-31 v1
Abstract
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.
Cite
@article{arxiv.0812.4814,
title = {Nominalistic Logic (Extended Abstract)},
author = {Jørgen Villadsen},
journal= {arXiv preprint arXiv:0812.4814},
year = {2008}
}
Comments
3 pages