Abstract
Let T be a set of axioms. This set gives rise to a theory T H in Heyting’s predicate logic and a theory T C in the classical predicate logic. More generally, if X is any intermediate logic, we get a theory T X.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
Section 6 on the undecidability of 2nd order intuitionistic propositional calculus is based on the paper by the author in the Archiv für Math. Logic 1974. Sobolev 1977 pointed out that the original definition of N(x) (Definition 2a in my paper of 1974) allows for the case x = f. Thus in the definition of N(x) in this book (Section 6) the conjunct (1x→E) is added and the case x = f is excluded. Sobolev 1977 suggests another way of correcting the gap. He changes the definition of D(x) to handle the case x = f.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Gabbay, D.M. (1981). Undecidability Results. In: Semantical Investigations in Heyting’s Intuitionistic Logic. Synthese Library, vol 148. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2977-2_15
Download citation
DOI: https://doi.org/10.1007/978-94-017-2977-2_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8362-3
Online ISBN: 978-94-017-2977-2
eBook Packages: Springer Book Archive