## Theories With Self-Application and Computational Complexity (2002)

### Cached

### Download Links

- [www.iam.unibe.ch]
- [www.iam.unibe.ch]
- [www.iam.unibe.ch]
- [www.iam.unibe.ch]
- DBLP

### Other Repositories/Bibliography

by
Thomas Strahm

Venue: | Information and Computation |

Citations: | 12 - 9 self |

### BibTeX

@ARTICLE{Strahm02theorieswith,

author = {Thomas Strahm},

title = {Theories With Self-Application and Computational Complexity},

journal = {Information and Computation},

year = {2002},

volume = {185},

pages = {263--297}

}

### OpenURL

### Abstract

Applicative theories form the basis of Feferman's systems of explicit mathematics, which have been introduced in the early seventies. In an applicative universe, all individuals may be thought of as operations, which can freely be applied to each other: self-application is meaningful, but not necessarily total. It has turned out that theories with self-application provide a natural setting for studying notions of abstract computability, especially from a proof-theoretic perspective.