General models, descriptions, and choice in type theory

Journal of Symbolic Logic 37 (2):385-394 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272981

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Reasoning in simple type theory — Festschrift in honor of Peter B. Andrews on his 70th birthday, Studies in Logic, vol. 17. [REVIEW]Christoph Benzmüller, Chad E. Brown, Jörg Siekmann & Richard Statman - 2010 - Bulletin of Symbolic Logic 16 (3):409-411.
Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Computer science and applied mathematics. Academic Press, Orlando etc. 1986, xv + 304 pp.M. Yasuhara - 1988 - Journal of Symbolic Logic 53 (1):312-314.
Andrews Peter B.. An introduction to mathematical logic and type theory: to truth through proof. Applied logic series, vol. 27. Kluwer Academic Publishers, Dordrecht, Boston, and London, 2002, xviii+ 390 pp. [REVIEW]Mitsuru Yasuhara - 2003 - Bulletin of Symbolic Logic 9 (3):408-408.
Reasoning in simple type theory – Festschrift in honor of Peter B. Andrews on his 70th birthday, edited by Christoph Benzmüller, Chad E. Brown, Jörg Siekmann, and Richard Statman, Studies in Logic, vol. 17. College Publications, London, 2008, 454 pp. [REVIEW]Florian Rabe - 2010 - Bulletin of Symbolic Logic 16 (3):409-411.
Peter B. Andrews. Resolution with merging. Journal of the Association for Computing Machinery, vol. 15 , pp. 367–381.David Luckham - 1970 - Journal of Symbolic Logic 35 (1):159-160.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
Realizing realizability results with classical constructions.Asaf Karagila - 2019 - Bulletin of Symbolic Logic 25 (4):429-445.
Burton Dreben, Peter Andrews, and Stål Aanderaa. False lemmas in Herbrand. Bulletin of the American Mathematical Society, vol. 69, pp. 699–706. [REVIEW]Burton Dreben & Peter Andrews - 1966 - Journal of Symbolic Logic 31 (4):657-659.
Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740.Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401.
Cut-elimination for simple type theory with an axiom of choice.G. Mints - 1999 - Journal of Symbolic Logic 64 (2):479-485.

Analytics

Added to PP
2009-01-28

Downloads
134 (#331,091)

6 months
26 (#383,582)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Cut-Elimination for Quantified Conditional Logic.Christoph Benzmüller - 2017 - Journal of Philosophical Logic 46 (3):333-353.

View all 11 citations / Add more citations

References found in this work

A Transfinite Type Theory with Type Variables.R. O. Gandy - 1965 - Journal of Symbolic Logic 33 (1):112-113.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5 (3):161-180.

Add more references