On being called by one's name

Logica Trianguli 5:43-61 (2001)
  Copy   BIBTEX

Abstract

Is a name N an abbreviation of the uniquely identifying description: “the individual called N”? A recent negative answer to that question, saying that the description is associated with the name and that the name is not reducible to that description, is first considered. Then it is shown that the introduction of the indexical operator “actually” allows one to assimilate the name and the description

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

  • This entry has no external links. Add one.
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

Being and Being Called.Diego Marconi - 2009 - Journal of Philosophy 106 (3):113-136.
Philosophical Truth in Mathematical Terms and Literature Analogies.Emilia Anvarovna Taissina - 2008 - Proceedings of the Xxii World Congress of Philosophy 53:273-278.
Disquieting conversations with the man called U. G.: mind is a myth.U. G. Krishnamurti - 1987 - Vallabhvidyanagar, Gujarat, India: Crest Associates. Edited by Terry Newland.
The Yoga-system of Patañjali. Patañjali - 1914 - New York,: Gordon Press. Edited by James Haughton Woods, Vyāsa & Vācaspatimiśra.
Job After Auschwitz.Murray J. Haar - 1999 - Interpretation: A Journal of Bible and Theology 53 (3):265-275.
From Harrods to Africa: The Travels of a Lion Called Christian.Jopi Nyman - 2012 - Society and Animals 20 (3):294-310.
Constrained semantic transference: A formal theory of metaphors.Bipin Indurkhya - 1986 - Synthese 68 (3):515 - 551.
An Observation on Common Names and Proper Names.John Tienson - 1986 - Analysis 46 (2):73 - 76.
Fallacies.Robert J. Fogelin & Timothy J. Duggan - 1987 - Argumentation 1 (3):255-262.
that B is Turing reducible to A and write B≤ T A. We say that B≡ T A if B≤ T A and A≤ T B.≡ T is an equivalence relation, and≤ T induces a par-tial ordering on the corresponding equivalence classes; the poset obtained in this way is called the degrees of unsolvability, and elements of this poset are called degrees. [REVIEW]J. Knight, A. Kucera & R. Shore - 1995 - Bulletin of Symbolic Logic 1 (2).
How Rights Became “Subjective”.Thomas Mautner - 2013 - Ratio Juris 26 (1):111-132.
called degrees. Post was particularly interested in computability from sets which are par-tially generated by a computer, namely, those for which the elements of the set can be enumerated by a computer. These sets are called (recursively) enu-merable, as are their degrees. He showed [20] that the enumerable degrees. [REVIEW]J. Knight, A. Kucera & R. Shore - 1995 - Bulletin of Symbolic Logic 1 (2).

Analytics

Added to PP
2014-01-20

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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