Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs

Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs
Author :
Publisher : Springer Nature
Total Pages : 591
Release :
ISBN-10 : 9783030714307
ISBN-13 : 3030714306
Rating : 4/5 (306 Downloads)

Book Synopsis Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs by : Ivo Düntsch

Download or read book Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs written by Ivo Düntsch and published by Springer Nature. This book was released on 2021-09-24 with total page 591 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 (of relevant implication) and E (of relevant entailment), 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.


Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs Related Books

Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs
Language: en
Pages: 591
Authors: Ivo Düntsch
Categories: Philosophy
Type: BOOK - Published: 2021-09-24 - Publisher: Springer Nature

GET EBOOK

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 autobiographic
Relational and Algebraic Methods in Computer Science
Language: en
Pages: 515
Authors: Uli Fahrenberg
Categories: Computers
Type: BOOK - Published: 2021-10-22 - Publisher: Springer Nature

GET EBOOK

This book constitutes the proceedings of the 19th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2021, which took plac
Relational and Algebraic Methods in Computer Science
Language: en
Pages: 309
Authors: Roland Glück
Categories: Computers
Type: BOOK - Published: 2023-03-07 - Publisher: Springer Nature

GET EBOOK

This book constitutes the proceedings of the 20th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2023, which took plac
Ockham Algebras
Language: en
Pages: 241
Authors: Varlet Blyth
Categories: Language Arts & Disciplines
Type: BOOK - Published: 1994 - Publisher: Clarendon Press

GET EBOOK

An Ockham algebra is a natural generalization of a well known and important notion of a boolean algebra. Regarding the latter as a bounded distributive lattice
Proof Complexity
Language: en
Pages: 533
Authors: Jan Krajíček
Categories: Mathematics
Type: BOOK - Published: 2019-03-28 - Publisher: Cambridge University Press

GET EBOOK

Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic conce