Nominalistic Logic (Extended Abstract)
| dc.creator | Villadsen, Jørgen | |
| dc.date | 2008-12-28 | |
| dc.date.accessioned | 2026-07-07T12:22:57Z | |
| dc.date.available | 2026-07-07T12:22:57Z | |
| dc.description | 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. | |
| dc.description | 3 pages | |
| dc.identifier | https://arxiv.org/abs/0812.4814 | |
| dc.identifier | http://arxiv.org/abs/0812.4814 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/213829 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Nominalistic Logic (Extended Abstract) | |
| dc.type | text |