A κ-denotational semantics for map theory in ZFC + SI

Theoretical Computer Science

Volumn 179, Issue 1-2, 1997, Pages 137-202

  Berline, Chantal ^a   Grue, Klaus ^b  

^a INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; NUMERICAL METHODS; THEOREM PROVING;

CANONICAL MODELS; DENOTATIONAL SEMANTICS; MAP THEORY; SYNTACTIC TRANSLATION;

SET THEORY;

EID: 0031161842     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00302-7     Document Type: Review

References (38)

1. P. Aczel, Frege structures and the notions of proposition, truth and set, in: J. Barwise, H.J. Keisler and K. Kunen, eds., The Kleene Symp. (North-Holland, Amsterdam, 1980) 31-59.
2. J. Baeten and B. Boerboom, Omega can be anything it should not be, Indag. Math. 41 (1979) 111-120.
3. S. Van Bakel, Complete restrictions of the intersection type discipline, Theoret. Comput. Sci. 102 (1) (1992) 135-163.
4. H.P. Barendregt, The Lambda Calculus, Its Syntax and Semantics, Studies in Logic and The Foundation of Mathematics, Vol. 103 (North-Holland, Amsterdam, 1984).
5. C. Berline, Cours de Lambda-calcul, Université de Paris 7 1996, book in preparation.
6. C. Berline and K. Grue, A simple consistency proof for Map Theory, based on ξ-denotational semantics, Technical Report 50, Prepublication de l'Equipe de Logique Mathematique, 1994.
7. C.C. Chang and K.J. Keisler, Model Theory, Studies in Logic and the Foundations of Mathematics, Vol. 73 (North-Holland, Amsterdam, 1973).
8. A. Church, The Calculi of Lambda Conversion (Princeton University Press, Princeton, NJ, 1941).
9. M. Coppo, M. Dezani-Ciancaglini, F. Honsell and G. Longo, Extended type structures and filter lambda-models, in: G. Longo G. Lolli and A. Marcja, eds., Logic Colloquium '82 (Elsevier, Amsterdam, 1984) 241-262.
10. S. Feferman, Toward useful type-free theories.I, J. Symbolic Logic 49 (1984) 75-111.
11. R.C. Flagg, K-continuous lattices and comprehension principles for Frege structures, Ann. Pure Appl. Logic 36 (1987) 1-16.
12. R.C. Flagg and J. Myhill, An extension of Frege structures, in: E.G.K. Lopez-Escobar D.W. Kuecker and H. Smith, eds., Mathematical Logic and Computer Science (Marcel Dekker, New York, 1987) 197-217.
13. R.C. Flagg and J. Myhill, A type-free system extending ZFC, Ann. Pure Appl Logic 43 (1989) 79-97.
14. G. Frege, Begriffschrift, a formula language, modelled upon that of arithmetic, for pure thought, in: J. van Heijenoort, ed., A Source Book in Mathematical Logic, 1879-1931 (Harvard University Press, Cambridge, 1967) 1-83.
15. P. Di Gianantonio, F. Honsell and G. Plotkin, Uncountable limits and the lambda-calculus, Nordic J. Comput. 2 (1995) 126-145.
16. J.Y. Girard, The system F of variable types, fifteen years later, Theoret. Comput. Sci. 45 (1986) 159-192.
17. K. Grue, Map theory, Theoret. Comput. Sci. 102(1) (1992) 1-133.
18. K. Grue, Map theory - preface, appendix and index, DIKU Report 92/16, Department of Computer Science, University of Copenhagen, DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark, 1992.
19. K. Grue, Stable map theory, DIKU Report 96/10, Department of Computer Science, University of Copenhagen, DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark, April 1996. (Stable map theory has turned out to be inconsistent. To repair: remove the stability axioms and Chapter 4 and Lemma A.6.21 and A.6.25, and promote Lemma A.6.10 and A.6.22 to axioms).
20. D. Hubert and P. Bernays, Grundlagen der Mathematic, Vol. 2 (Springer, Berlin, 1939).
21. Y. Jiang, Consistency of a lambda-theory with n-tuples and easy terms, Arch. Math. Logic 34(2) (1995) 72-96.
22. R. Kerth, Isomorphisme et équivalence équationelle entre modéles du lambda-calcul, Ph.D. Thesis, Université Paris 7, 1995.
23. J.L. Krivine, Lambda-Calcul: Types et Modèles (Masson, Paris, 1990).
24. J.L. Krivine, Lambda-Calculus, Types and Models (Ellis & Horwood, Chichester, 1993).
25. K.G. Larsen and G. Winskel, Using information systems to solve recursive domain equations, in: Lecture Notes in Computer Science, Vol. 173 (Semantics of data types) (Springer, Berlin, 1984) 109-130.
26. J. McCarthy, A basis for a mathematical theory of computation, in: P. Brafford and D. Hirschberg, eds., Computer Programming and Formal Systems (North-Holland, Amsterdam, 1963) 33-70.
27. G. Plotkin, A power domain for countable non-determinism, in: Lecture Notes in Computer Science, Vol. 140, ICALP'82 (Springer, Berlin, 1982) 418-428.
28. G. Plotkin, Set-theoretical and other elementary models of the lambda-calculus (in a collection of contributions in honour of Corrado Bohm on the occasion of his 70th birthday), Theoret. Comput. Sci. 121(1-2) (1993) 159-192.
29. G. Plotkin, On a question of Friedman, preprint, 1995.
30. B. Poizat. Cours de Theorie des Modèles (Nur Al-Mantiq Wal-Ma'rifah, Paris, 1985).
31. M. Schönfinkel, On the building blocks of mathematical logic, in: J. van Heijenoort, ed., A Source Book in Mathematical Logic, 1879-1931 (Harvard University Press, Cambridge, 1967) 355-366.
32. D. Scott, Continuous lattices, in: F.W. Lawvere, ed., Lecture Notes in Mathematics, Vol. 274; Toposes, algebraic geometry and logic, Proc. Dalhousie Conf. (Springer, Berlin, 1972) 97-136.
33. D. Scott, Continuous lattices, in: F.W. Lawvere, ed., Lecture Notes in Mathematics, Vol. 274; Toposes, algebraic geometry and logic, Proc. Dalhousie Conf. (Springer, Berlin, 1972) 97-136.
34. D. Scott, Models for various type-free λ-calculi, in: Studies in Logic and The Foundation of Mathematics, Vol. 74, Proc. the IVth Internat. Congress for Logic, Methodology and Philosophy of Science (1973) pp. 157-187.
35. D. Scott, Combinators and classes, in: Lecture Notes in Computer Science, Vol. 37 (Springer, Berlin, 1975) 1-26.
36. D. Scott, Some philosophical issues concerning the theory of combinatorics, in: Lecture Notes in Computer Science, Vol. 37 (Springer, Berlin, 1975) 346-366.
37. D. Scott, Domains for denotational semantics, in: Lecture Notes in Computer Science, Vol. 140, ICALP '82 (Springer, Berlin, 1982) 577-613.
38. C. Zylberajch, Syntaxe et sémantique de la facilité en lambda-calcul, Ph.D. Thesis, Université Paris 7, 1991.