Abstract
We saw in previous chapters the following properties of h:
-
(1)
h is complete for the class of all finite trees
-
(2)
h + is complete for the class of all finite n-ary trees, for any n≥2.
-
(3)
h is complete for the infinite full binary tree.
This is a preview of subscription content, log in via an institution to check access.
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
Based on two of the author’s papers, one of them jointly with de Jongh and one paper of K. Fine (Section 3). Algebraic methods yielding many intermediate logics without f.m.p. were used by Cerciu-Kuznezov. M. K. Andrews has studied the Medvedev system.
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). Three Intermediate Logics. In: Semantical Investigations in Heyting’s Intuitionistic Logic. Synthese Library, vol 148. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2977-2_6
Download citation
DOI: https://doi.org/10.1007/978-94-017-2977-2_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8362-3
Online ISBN: 978-94-017-2977-2
eBook Packages: Springer Book Archive