358 PG. Hinman

In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 358 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

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

Through your library

Similar books and articles

Embedding FD(ω) into {mathcal{P}_s} densely.Joshua A. Cole - 2008 - Archive for Mathematical Logic 46 (7-8):649-664.
Kant's Philosophy of Law.E. L. Hinman - 1925 - The Monist 35 (2):280-295.
Descartes’ Children.Lawrence M. Hinman - 1982 - New Scholasticism 56 (3):355-370.
Is’ Presupposes ‘Ought.Lawrence M. Hinman - 1984 - Philosophical Studies (Dublin) 30:122-126.
Philosophy and Style.Lawrence M. Hinman - 1980 - The Monist 63 (4):512-529.
Can a Form of Life Be Wrong?Lawrence M. Hinman - 1983 - Philosophy 58 (225):339 - 351.
Philosophical Style. [REVIEW]Lawrence M. Hinman - 1982 - Teaching Philosophy 5 (3):268-269.
Distributive Justice. [REVIEW]Lawrence M. Hinman - 2004 - Teaching Philosophy 27 (3):269-272.
Comments.Lawrence M. Hinman - 1984 - International Studies in Philosophy 16 (2):23-26.
Modern idealism and the logos teaching.E. L. Hinman - 1921 - Philosophical Review 30 (4):333-351.

Analytics

Added to PP
2014-01-27

Downloads
10 (#1,187,905)

6 months
2 (#1,185,463)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references