Alasdair Urquhart
Urquhart at the Association for Symbolic Logic, Pittsburgh, Pennsylvania, May 2004
Born
Alasdair Ian Fenton Urquhart

20 December 1945
Scotland
NationalityScottish
CitizenshipCanadian
Occupation(s)university professor, editor
Academic background
Alma materUniversity of Edinburgh, MA
University of Pittsburgh, PhD
Thesis"The Semantics of Entailment" (1973)
Doctoral advisorAlan Ross Anderson and Nuel Belnap
Academic work
DisciplinePhilosophy
Sub-disciplineNon-classical logic
InstitutionsUniversity of Toronto
University of Toronto Mississauga

Alasdair Ian Fenton Urquhart (/ˈæləsdər ˈɜːrkərt/; born 20 December 1945) is a Scottish–Canadian philosopher and emeritus professor of philosophy at the University of Toronto.[1][2] He has made contributions to the field of logic, especially non-classical logic.[3] One of his ideas is proving the undecidability of the relevance logic R. He also published papers in theoretical computer science venues, mostly on mathematical logic topics of relevance to computer science.

Early life

Urquhart is a native of Scotland.[4] He received his MA in philosophy from the University of Edinburgh in 1967.[1][2] He then attended the University of Pittsburgh, receiving an MA and Ph.D. in 1973 under the supervision of Alan Ross Anderson and Nuel Belnap.[1][2]

Career

From 1973 to 1975, Urquhart was an assistant professor at Erindale College, University of Toronto Mississauga.[2] He became an associate professor there in 1975.[2] Starting in 1986, Urquhart was a professor of philosophy at the University of Toronto.[1][2]

From 1983 to 1989, Urquhart was a consulting editor for the Journal of Symbolic Logic.[2] He was also an editor of Canadian Philosophical Monographs.[2] In 2003, he became the managing editor of reviews for The Bulletin of Symbolic Logic.[5]

He is currently on the Council of the Division for Logic, Methodology and Philosophy of Science and Technology of the International Union of History and Philosophy of Science and Technology (2020–2023).[6]

Selected publications

  • Urquhart, Alasdair and Rescher, Nicholas. Temporal Logic. New York: Springer Verlag, 1971. ISBN 978-3-7091-7664-1
  • Urquhart, Alasdair. "The Undecidability of Entailment and Relevant Implication." Journal of Symbolic Logic 49:4 (1984): 1059–1073.[1]
  • Urquhart, Alasdair and Cook, Stephen A. "Functional Interpretations of Feasibly Constructive Arithmetic", Annals of Pure and Applied Logic, 1993; preliminary version at STOC'89
  • "The Complexity of Decision Procedures in Relevance Logic II", Journal of Symbolic Logic 64:4 (1999): 1774–1802.

References

  1. 1 2 3 4 5 "Alasdair Urquhart". Department of Philosophy. Retrieved 22 August 2022.
  2. 1 2 3 4 5 6 7 8 "Alasdair Urquhart's Curriculum Vita". stanford.library.sydney.edu.au. April 1998. Retrieved 22 August 2022.
  3. ↑ Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs. Outstanding Contributions to Logic. Vol. 22. 2022. doi:10.1007/978-3-030-71430-7. ISBN 978-3-030-71429-1.
  4. ↑ "Alasdair Urquhart was born in Scotland in 1945". Department of Computer Science - University of Toronto. Retrieved 2 April 2010.
  5. ↑ Leng, Mary. "Reviews". The Bulletin of Symbolic Logic 8, no. 4 (2002): 516. via JSTOR. doi:10.2307/797954.
  6. ↑ "DLMPST Website: Council 2020-2023". Retrieved 16 April 2020.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.