Springer Verlag (2021)

Authors
Edwin Mares
Victoria University of Wellington
Abstract
This book is dedicated to the work of Alasdair Urquhart. The book starts out with an introduction to and an overview of Urquhart’s work, and an autobiographical essay by Urquhart. This introductory section is followed by papers on algebraic logic and lattice theory, papers on the complexity of proofs, and papers on philosophical logic and history of logic. The final section of the book contains a response to the papers by Urquhart. Alasdair Urquhart has made extremely important contributions to a variety of fields in logic. He produced some of the earliest work on the semantics of relevant logic. He provided the undecidability of the logics R and E, as well as some of their close neighbors. He proved that interpolation fails in some of those systems. Urquhart has done very important work in complexity theory, both about the complexity of proofs in classical and some nonclassical logics. In pure algebra, he has produced a representation theorem for lattices and some rather beautiful duality theorems. In addition, he has done important work in the history of logic, especially on Bertrand Russell, including editing Volume four of Russell’s Collected Papers.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Reprint years 2022
Buy this book $99.37 new (34% off)   $120.38 used (20% off)   Amazon page
ISBN(s) 978-3-030-71429-1   978-3-030-71430-7   3030714292   9783030714291
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,541
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

Chapters

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
The Complexity of Propositional Proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
The Complexity of Decision Procedures in Relevance Logic II.Alasdair Urquhart - 1999 - Journal of Symbolic Logic 64 (4):1774-1802.
The Complexity of Decision Procedures in Relevance Logic II.Alasdair Urquhart - 1999 - Journal of Symbolic Logic 64 (4):1774-1802.
Proofs, Snakes and Ladders.Alasdair Urquhart - 1974 - Dialogue 13 (4):723-731.
Simplified Lower Bounds for Propositional Proofs.Alasdair Urquhart & Xudong Fu - 1996 - Notre Dame Journal of Formal Logic 37 (4):523-544.
The Complexity of Analytic Tableaux.Noriko H. Arai, Toniann Pitassi & Alasdair Urquhart - 2006 - Journal of Symbolic Logic 71 (3):777 - 790.

Analytics

Added to PP index
2021-12-18

Total views
0

Recent downloads (6 months)
0

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes