On the existence of certain total recursive functions in nontrivial axiom systems, I
N. C. A. da Costa, F. A. Doria
cmp-lgarXiv:cmp-lg/9804005
Abstract
We investigate the existence of a class of ZFC-provably total recursive unary functions, given certain constraints, and apply some of those results to show that, for Σ1-sound set theory, ZFC P<NP.
Create a lesson
Related papers
A Memory-Based Approach to Learning Shallow Natural Language Patterns
Shlomo Argamon, Ido Dagan, Yuval Krymolowski
A Comparison of WordNet and Roget's Taxonomy for Measuring Semantic Similarity
Michael Mc Hale
Some Ontological Principles for Designing Upper Level Lexical Resources
Nicola Guarino
Towards an implementable dependency grammar
Timo Jarvinen, Pasi Tapanainen
A Variant of Earley Parsing
Mark-Jan Nederhof, Giorgio Satta
Segregatory Coordination and Ellipsis in Text Generation
James Shaw