Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels

Annals of Pure and Applied Logic

Volumn 81, Issue 1-3, 1996, Pages 187-239

  Lipton, James ^a   O'Donnell, Michael J ^b  

^a WESLEYAN UNIVERSITY   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030243450     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(96)00002-4     Document Type: Article

References (43)

1. [1] M.J. Beeson, Foundations of Constructive Mathematics, (Springer, Berlin, 1980).
2. [2] E.W. Beth, The Foundations of Mathematics, A Study in the Philosophy of Science, Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, 1959).
3. [3] R. Blute and P.J. Scott, Linear Läuchli semantics. Ann. Pure Appl. Logic 77 (1996) 102-142.
4. [4] M.A.E. Dummett, Elements of Intuitionism (Oxford Univ. Press, Oxford, 1977).
5. [5] S. Feferman, Constructive theories of functions and classes, in: M. Boffa, D. van Dalen, and K. McAloon, Eds., Logic Colloquium 78, (North-Holland, Amsterdam, 1979) 159-224; Proc. Colloquium held in Mons (August 1978).
6. [5] S. Feferman, Constructive theories of functions and classes, in: M. Boffa, D. van Dalen, and K. McAloon, Eds., Logic Colloquium 78, (North-Holland, Amsterdam, 1979) 159-224; Proc. Colloquium held in Mons (August 1978).
7. [6] F.B. Fitch, Elements of Combinatory Logic (Yale University Press, New Haven, CT, 1974).
8. [7] M.C. Fitting, Intuitionistic Logic, Model Theory, and Forcing, Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, London, 1969).
9. [8] P.J. Freyd and A. Scedrov, Categories, Allegories (North-Holland, Amsterdam, 1990).
10. [9] J.-Y. Girard, Y. Lafont and P. Taylor, Proofs and Types. Cambridge Tracts in Theoretical Computer Science (Cambridge Univ. Press, Cambridge, 1989).
11. [10] V. Harnik and M. Makkai, Lambek's categorical proof theory and läuchli's abstract realizability, J. Symbolic Logic 57 (1992) 200-230.
12. [11] V. Harnik and M. Makkai, The fibrational formulation of intuitionistic predicate logic i: completeness according to Gödel, Kripke and Läuchli. Part i, Notre Dame J. Formal Logic 34 (1993) 334-377.
13. [12] V. Harnik and M. Makkai, The fibrational formulation of intuitionistic predicate logic i: completeness according to Gödel, Kripke and Läuchli. Part ii, Notre Dame J. Formal Logic 34 (1993) 471-498.
14. [13] A. Heyting, Die formalen Regeln der intuitionistischen Logik, Sitzungsberichte der Preussischen Academie der Wissenschaften, Physikalisch-Matematische Klasse, (1930) 42-56.
15. [14] W.A. Howard, The formulae-as-types notion of construction, in: J.P. Seldin and J.R. Hindley, Eds., To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (Academic Press, New York, 1980) 479-490.
16. [15] S.C. Kleene, On the interpretation of intuitionistic number theory, J. Symbolic Logic 10 (1945) 109-124.
17. [16] S.C. Kleene, Realizability, in: A. Heyting, Ed., Constructivity in Mathematics (North-Holland, Amsterdam, 1959) 285-289; Proc. Colloquium held in Amsterdam (August 26-31, 1957).
18. [16] S.C. Kleene, Realizability, in: A. Heyting, Ed., Constructivity in Mathematics (North-Holland, Amsterdam, 1959) 285-289; Proc. Colloquium held in Amsterdam (August 26-31, 1957).
19. [17] S.C. Kleene and R.E. Vesley, The Foundations of Intuitionistic Mathematics, Especially in Relation to Recursive Functions, Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, London, 1965).
20. [18] S.A. Kripke, Semantical analysis of modal logic I: Normal modal prepositional calculi, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 9 (1963) 67-96.
21. [19] S.A. Kripke, Semantical analysis of intuitionistic logic. I, in: J.N. Crossley and M.A.E. Dummett, Eds., Formal Systems and Recursive Functions (North-Holland, Amsterdam, 1965) 92-130; Proc. 8th Logic Colloquium, Oxford (July 1963).
22. [19] S.A. Kripke, Semantical analysis of intuitionistic logic. I, in: J.N. Crossley and M.A.E. Dummett, Eds., Formal Systems and Recursive Functions (North-Holland, Amsterdam, 1965) 92-130; Proc. 8th Logic Colloquium, Oxford (July 1963).
23. [20] S.A. Kurtz, J. Mitchell and M.J. O'Donnell, Connecting formal semantics to constructive intuitions, in: Proc. Symp. on Constructivity in Computer Science, Trinity University, San Antonio TX, June 1991, Lecture Notes in Computer Science, Vol. 613 (Springer, Berlin, 1992) 1-21.
24. [20] S.A. Kurtz, J. Mitchell and M.J. O'Donnell, Connecting formal semantics to constructive intuitions, in: Proc. Symp. on Constructivity in Computer Science, Trinity University, San Antonio TX, June 1991, Lecture Notes in Computer Science, Vol. 613 (Springer, Berlin, 1992) 1-21.
25. [21] J. Lambek and P.J. Scott, Introduction to Higher Order Categorical Logic (Cambridge Univ. Press, Cambridge, 1986).
26. [22] H. Läuchli, An abstract notion of realizability for which intuitionistic predicate calculus is complete, in: A. Kino, J. Myhill and R.E. Vesley, Eds., Intuitionism and Proof Theory, Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, London, 1970); 277-234; Proc. Conf. Intuitionism and Proof Theory, Buffalo, New York (August 1968).
27. [22] H. Läuchli, An abstract notion of realizability for which intuitionistic predicate calculus is complete, in: A. Kino, J. Myhill and R.E. Vesley, Eds., Intuitionism and Proof Theory, Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, London, 1970); 277-234; Proc. Conf. Intuitionism and Proof Theory, Buffalo, New York (August 1968).
28. [23] J. Lipton, Type theory and inhabitation: A constructive completeness theorem for Martin-Löf type theory, Ann. Pure Appl. Logic, submitted.
29. [24] J. Lipton, Constructive kripke semantics and realizability, in: Y. Moschovakis, Ed., Logic for Computer Science, MSRI Workshop Proc. (Springer, Berlin, 1992).
30. [25] J. Lipton and M.J. O'Donnell, Intuitive counterexamples for constructive fallacies, in: I. Privara, B. Rovan, and P. Ružička, Eds., Mathematical Foundations of Computer Science 1994 - 19th Internat. Symp. MFCS '94, Košice, Slovakia, August 1994 - Proc. Lecture Notes in Computer Science, Vol. 841 (Springer, Berlin, 1984) 87-111.
31. [26] J. Mitchell and A. Scedrov, Notes on sconing and relators, in: CSL '92: 1992 Computer Science Logic Proc. Lecture Notes in Computer Science (Springer, Berlin, 1993).
32. [27] A. Nerode, Some lecures on intuitionistic logic i, in: Logical Foundations of Computer Science, 1988 CIME Summer School, Montecatini, Italy, Lecture Notes in Computer Science (Springer, Berlin, 1991).
33. [28] P. Odifreddi, Classical recursion Theory (North-Holland, Amsterdam, 1989).
34. [29] C.S. Peirce, On the algebra of logic: a contribution to the philosophy of notation, Amer. J. Math. 8 (1885) 180-202.
35. [30] D. Prawitz, Natural Deduction (Almqvist & Wiksell, Stockholm, 1965).
36. [31] G.F. Rose, Propositional calculus and realizability, Trans. Amer. Math. Soc. 75 (1953) 1-19.
37. [32] A. Scedrov and P. Scott, A note on the friedman slash and the freyd covers, in: A. Troesltra and D. van Dalen, Eds., The L.E.J. Brouwer Centenary Symp. (North-Holland, Amsterdam, 1982).
38. [33] C.A. Smorynski, Applications of kripke models, in: Mathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics, Vol. 344 (Springer, Berlin, 1973).
39. [34] R. Statman, Logical relations and the typed lambda calculus, Inform. Control 65 (1985) 85-97.
40. [35] S. Stenlund, Combinators, λ-terms, and Proof Theory (D. Riedel, Dordrecht-Holland, 1972).
41. [36] A.S. Troelstra, Choice Sequences: a chapter of intuitionistic mathematics, Oxford Logic Guides (Clarendon Press, Oxford, 1977).
42. [37] A.S. Troelstra and D. van Dalen, Constructivism in Mathematics: An Introduction, Vol. II, Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, 1988).
43. [38] J. van Oosten, Exercises in Realizability, PhD Thesis, Univ. of Amsterdam, 1990.