Asset Details
Do you wish to reserve the book?
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi
Do you wish to request the book?
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi
2014
Overview
We give a new proof of the following result (originally due to Linial and Post): it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of modus ponens and substitution, axiomatizes the classical logic. Moreover, we prove the same for every superintuitionistic calculus. As a corollary, it is undecidable whether a given calculus is consistent, whether it is superintuitionistic, whether two given calculi have the same theorems, whether a given formula is derivable in a given calculus. The proof is by reduction from the undecidable halting problem for the so-called tag systems introduced by Post. We also give a historical survey of related results.
Publisher
Springer Science+Business Media B. V,Springer Netherlands,Springer Nature B.V
