Abstract
This paper investigates various interpretations of HPC (Heyting's predicate calculus) and mainly of HPC0 (Heyting's propositional calculus) in Post systems.
§1 recalls some background material concerning HPC including the Kripke and Beth interpretations, and later sections study the various interpretations available.
Similar content being viewed by others
References
G. Kreisel, unpublished appendix to the paper inInfinitistic methods, Warsaw 1959.
A. Tarski,Logic, semantics, metamathematics, Oxford 1956.
S. Kripke,Semantic method in intuitionistic logic, inFormal systems and recursive functions, Crossely-Dummett ed. pp. 92–130.
D. Gabbay,Completeness properties of HPC with respect to recursive models,Journal of Symbolic Logic, to appear.
T. Medvedev,Interpretations of logical formulae by means of finite problems,Doklady Akademii Nauk SSSR, Vol. 7 (1966), pp. 857–860.
A. Grzegorczyk,An approach to logical calculus,Studia Logica, Vol. XXX, pp. 33-43.
D. Scott,Completeness and axiomatizability in many valued logics,Tarski Volume, AMS, edited by L. Henkin.
D. Gabbay,Semantical investigations in Heyting's logic, to appear, D. Reidel 1977.
D. Gabbay,What is a classical connective,Zeitschrift für mathematische Logik und Grundlagen der Mathematik, to appear.
A. Troelstra,Mathematical investigations of intuitionistic arithmetic and analysis, Springer.
D. Gabbay,Application of trees to intermediate logic,Journal of Symbolic Logic 37 (1972), pp. 135–138.
Author information
Authors and Affiliations
Additional information
Allatum est die 27 Octobris 1975
Rights and permissions
About this article
Cite this article
Gabbay, D.M. On Kreisel's notion of validity in post systems. Stud Logica 35, 285–295 (1976). https://doi.org/10.1007/BF02282491
Issue Date:
DOI: https://doi.org/10.1007/BF02282491