Axiomatic Characterizations of Hyperuniverses and Applications

Annals of the New York Academy of Sciences

Volumn 806, Issue , 1996, Pages 140-163

  Forti, Marco ^a,c   Honsell, Furio ^b   Lenisa, Marina ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

^c GNSAGA of CNR

Author keywords

Exponential uniformities; Hyperuniverses; Metric semantics for programming languages; Non well founded sets

Indexed keywords

EID: 0011092313     PISSN: 00778923     EISSN: None     Source Type: Book Series    
DOI: 10.1111/j.1749-6632.1996.tb49165.x     Document Type: Article

References (26)

1. ABRAMSKY, S. 1988. A Cook's tour of finitary non-wellfounded sets. Unpublished manuscript.
2. ACZEL, P. 1988. Non-well-founded sets. CSLI Lecture Notes. 14. Stanford 1988
3. AMERICA, P. & J.J.M.M. RUTTEN. 1989. Solving domain equations in a category of complete metric spaces. J. Comp. Sys. Sci. 39: 343-375.
4. DE BARKER, J.W. & J.I. ZUCKER. 1982. Processes and denotational semantics of concurrency. Info. Contr. 54: 70-120.
5. ENGELKING, R. 1977. General Topology. Polish Scientific Publishers. Warszawa.
6. ESSER, O. 1955. An interpretation of the Zermelo-Frasnkel set theory and the Kelley-Morse set theory in a positive theory. Manuscript.
7. FORSTER, T. 1983. Axiomatizing set Theory with a Universal Set. Manuscript.
8. FORTI, M., & R. HINNION. 1989. The consistency problem for positive comprehension principles. J. Symb. Logic. 54: 1401-1418.
9. FORTI, M. & F. HONSELL. 1983. Set theory with free construction principles. Ann. Scuola Norm. Sup. Pisa, Cl. Sci. 10: (4) 493-522.
10. FORTI, M. & F. HONSELL. 1984/85/87. Axioms of choice and free construction principles I. Bull. Soc. Math. Belg. 36: (B) 69-79; II, Ibid. 37: (B) fasc.2, 1-12; III, Ibid. 39: (B) , 259-76.
11. FORTI, M. & F. HONSELL. 1984/85/87. Axioms of choice and free construction principles I. Bull. Soc. Math. Belg. 36: (B) 69-79; II, Ibid. 37: (B) fasc.2, 1-12; III, Ibid. 39: (B) , 259-76.
12. FORTI, M. & F. HONSELL. 1984/85/87. Axioms of choice and free construction principles I. Bull. Soc. Math. Belg. 36: (B) 69-79; II, Ibid. 37: (B) fasc.2, 1-12; III, Ibid. 39: (B) , 259-76.
13. FORTI, M. & F. HONSELL. 1989. Models of Selfdescriptive Set Theories. In: Partial Differential Equations and the Calculus of Variations, Essays in Honor of Ennio De Giorgi, I (F. Colombini et al. Eds.). Birkhäuser. Boston, Massachusetts. 473-518.
14. FORTI, M. & F. HONSELL. 1992. Weak Foundation and Antifoundation Properties of Positively Comprehensive Hyperuniverses. In: L'Anti-fondation en Logique et en Théorie des Ensembles (R. Hinnion, Ed.). Cahiers du Centre de Logique. Louvainla-Neuve. 7: 31-43.
15. FORTI, M. & F. HONSELL. 1996. A general construction of Hyperuniverses. Theoretical Computer Science. 156: 203-215.
16. FORTI, M. & F. HONSELL. 1996. Choice Principles in Hyperuniverses. Annals of Pure & Applied Logic. 77: 35-52.
17. FORTI, M., F. HONSELL, & M. LENISA. 1994. Processes and Hyperuniverses. In: Mathematical Foundations of Computer Science. (I. Prívara et al., Eds.). Springer Lecture Notes in Computer Science. Berlin. 841: 352-361.
18. HONSELL, F. & M. LENISA. 1995. Final Semantics for Untyped Lambda Calculus. In: TLCA '95 (M. Dezani & G. Plotkin, Eds.). Springer Lecture Notes in Computer Science. Berlin. 902: 249-265.
19. JECH, T.J. 1978. Set theory. Academic Press. New York. 1978.
20. KURATOWSKI, K. 1966. Topology. Academic Press. New York.
21. LENISA, M. 1966. Final Semantics for a Higher Order Concurrent Language. In: CAAP '96 (H. Kirchner, Ed.). Springer Lecture Notes in Computer Science. Berlin. 1059: 202-218.
22. MALITZ, R.J. 1976. Set theory in which the axiom of foundation fails. Ph.D. Thesis, UCLA, Los Angeles. Unpublished.
23. MISLOVE, M.W., L.S. MOSS, & F.J. OLES. 1991. Non-wellfounded Sets Modeled as Ideal Fixed Points. Information and Computation. 93: 16-54.
24. RUTTEN, J.J.M.M. & D. TURI. 1993. On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders(REX Conference Proceedings) (J.de Bakker et al., Eds.). Springer Lecture Notes in Computer Science. 666: 477-530.
25. μ-metric spaces. Fundam. Math. 65: 317-324.
26. WEYDERT, E. 1989. How to approximate the naive comprehension scheme inside of classical logic. Bonner mathematische Schriften. 194. Bonn.