Page 173 - Textos de Matemática Vol. 40
P. 173
Bibliography 161
[Hin78] [HK95]
[HKvL06]
[HM04]
[HN88] [HS86] [HvL03]
[HvNN27]
[Ja¨g80] [J¨ag82]
[J¨ag83]
[J¨ag84] [J¨ag86]
Peter Hinman. Recursion-Theoretic Hierarchies. Springer, 1978.
Susumu Hayashi and Satoshi Kobayashi. A new formulation of Fe- ferman’s system of functions and classes and its relation to Frege structures. International Journal of Foundations of Computer Sci- ence, 6(3):187–202, September 1995.
Fritz Hamm, Hans Kamp, and Michiel van Lambalgen. There is no opposition between formal and cognitive semantics. Theoretical Linguistics, 32:1–40, 2006.
Michael Hallett and Ulrich Majer, editors. David Hilbert’s Lectures on the Foundations of Geometry 1891–1902. David Hilbert’s Lec- tures on the Foundations of Mathematics and Physics, 1891–1933, 1. Springer, 2004.
S. Hayashi and H. Nakano. PX: A Computational Logic. MIT Press, 1988.
James Hindley and Jonathan Seldin. Introduction to Combinators and λ-calculus. Cambridge University Press, 1986.
Fritz Hamm and Michiel van Lambalgen. Nominalization, the pro- gressive and event calculus. Linguistics and Philosophy, 26:381–458, 2003.
David Hilbert, Johann von Neumann, and Lothar Nordheim. U¨ber die Grundlagen der Quantenmechanik. Mathematische Annalen, 98:1–30, 1927. Reprinted in [vN61a, p. 104–133].
Gerhard J¨ager. Beweistheorie von KPN. Archiv fu¨r mathematische Logik und Grundlagenforschung, 20:53–64, 1980.
Gerhard J¨ager. Zur Beweistheorie der Kripke-Platek-Mengenlehre u¨ber den natu¨rlichen Zahlen. Archiv fu¨r mathematische Logik und Grundlagenforschung, 22:121–139, 1982.
GerhardJ¨ager.Awell-orderingproofforFeferman’stheoryT0. Archiv fu¨r mathematische Logik und Grundlagenforschung, 23:65– 77, 1983.
Gerhard J¨ager. The strength of admissibility without foundation. Journal of Symbolic Logic, 49(3):867–879, September 1984.
Gerhard J¨ager. Theories for Admissible Sets. A unifying Approach to Proof Theory. Bibliopolis, 1986.