Preview
Unable to display preview. Download preview PDF.
References
Kolmogorov, A.N.: Zur Deutung der intuitionistische Logic. Math. Z. (1932), v.35
Kleene S.C.: On the interpretation of intuitionistic number theory. J Symb. Logic, (1945), v.10, 109–124
Kreisel G.: Interpretation of analysis by means of constructive functionals of finite types. Constructivity of Mathematics, North Holland, (1959), 101–128
Gödel K.: Uber eine noch nicht benutzte Erweiterung des finiten Standpunktes. Dialectica, 3/4, (1958), v.12, 280–287
Kleene S.C.: Vesley R.Y. The foundations of intuitionistic mathematics. North Holland, (1956)
Howard W.A.: The formulae-as-types notion of construction. Festschrist on the Occasion of H.B.Curry's 80th Birthday, Academic Press, (1980), 479–490
Diller J.: Modified realization and the formulae-as-types notion, Ibid, 491–502
McCarthy Ch.: Realizability and recursive set theory. Ann. Pure and Appl. Log., 2 (1986), 32, 153–184
Ershov Yu.L.: Decidability problems and constructive models. Moscow, Nauka, (1980) (In Russian)
Nepeivoda N.N., Sviridenko D.I.: On the theory of program synthesis, Trudy Math. Inst., 2(1982), 159–175
Voronkov A.A.: Automatic program synthesis and realizability. Matematicheskie Osnovy Raspoznavaniya Obrasov, Erevan, Acad. Sci. of Armenian SSR, (1985), 38–40 (In Russian)
Plisko V.E.: On language with constructive logical connectives. Soviet Math. Doklady, 1 (1987), v.296
Voronkov A.A: Model theory based on constructive notion of truth. Trudy Math. Inst., Novosibirsk, (1988), v.8, 25–42 (In Russian)
Voronkov A.A.: Logic programs and their synthesis. Preprint of Math. Inst., Novosibirsk, 23(1986), p.32 (In Russian)
Voronkov A.A.: Synthesis of logic programs. 24(1986), p.42.
Ershov Yu.L.: Theory of enumerations. Moscow, Nauka, 1977 (In Russian)
Scott D.S.: Domains for denotational semantics Lect. Notes in Comp. Sci. 1982. v.140. 577–612
Kamimura T., Tang J.: Effectively given spaces. Theoretical Comp. Sci. (1984)
Harrop R.: Concerning formulas of the types A→BvC, A→(Ex)B(x) in intuitionistic formal system. J. Symb. Logic, 1(1962), v.27, 27–32
Goad C.A.: Computational uses of the manipulation of formal proofs. Stanford Univ. Tech. Report, CS-80-819, (1980), p.122
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Starchenko, S.S., Voronkov, A.A. (1990). On connections between classical and constructive semantics. In: Martin-Löf, P., Mints, G. (eds) COLOG-88. COLOG 1988. Lecture Notes in Computer Science, vol 417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52335-9_59
Download citation
DOI: https://doi.org/10.1007/3-540-52335-9_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52335-2
Online ISBN: 978-3-540-46963-6
eBook Packages: Springer Book Archive