Linked bibliography for the SEP article "Non-wellfounded Set Theory" by Lawrence S. Moss

This is an automatically generated and experimental page

If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.

This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.

  • Aczel, P., 1988, Non-Well-Founded Sets (CSLI Lecture Notes: Number 14), Stanford: CSLI Publications. (Scholar)
  • Aczel, P. and Mendler, N., 1989, ‘A final coalgebra theorem,’ in D. H. Pitt et al. (eds.), Category Theory and Computer Science, Heidelberg: Springer-Verlag, 357–365.
  • Adámek, J., and Reitermann, J., 1994, ‘Banach’s Fixed-Point Theorem as a Base for Data-Type Equations,’ Applied Categorical Structures, 2: 77–90. (Scholar)
  • Alexandru Baltag, 2000, ‘STS: A Structural Theory of Sets,’ in Michael Zakharyaschev, Krister Segerberg, Maarten de Rijke & Heinrich Wansing (eds.), Advances in Modal Logic (Volume 2), Stanford: CSLI Publications,. 1–34. (Scholar)
  • Barwise, J., and Etchemendy, J., 1987, The Liar, Oxford: Oxford University Press. (Scholar)
  • Barwise, J., and Moss, L., 1991, ‘Hypersets’, The Mathematical Intelligencer, 13(4): 31–41. (Scholar)
  • Barwise, J., and Moss, L., 1996, Vicious Circles (CSLI Lecture Notes: Number 60), Stanford: CSLI Publications. (Scholar)
  • Böge, W., and Eisele, T., 1979, ‘On solutions of Bayesian games,’ International Journal of Game Theory, 8(4): 193–215. (Scholar)
  • Boolos, G., 1971, ‘The iterative conception of set,’ The Journal of Philosophy, 68: 215–231. (Scholar)
  • Burgess, J., 1985, Reviews, Journal of Symbolic Logic, 50(2): 544–547. (Scholar)
  • Corfield, D., 2011, ‘Understanding the Infinite II: Coalgebra, Studies in History and Philosophy of Science (A), 42: 571–579. (Scholar)
  • Edalat, A., 1995, ‘Dynamical Systems, Measures and Fractals via Domain Theory,’ Information and Computation, 120(1): 32–48. (Scholar)
  • Thomas Forster, 1994, ‘Why Set theory without the axiom of foundation?’ Journal of Logic and Computation, 4(4): 333–335. (Scholar)
  • Forti, M. and Honsell, F., 1983, ‘Set theory with free construction principles‘, Annali Scuola Normale Superiore di Pisa, Classe di Scienze, 10: 493–522. (Scholar)
  • Harsanyi, J. C., 1967, ‘Games with incomplete information played by ‘Bayesian’ players. I. The basic model,’ Management Science, 14: 159–182. (Scholar)
  • Hayashi, S., 1985, ‘Self-similar sets as Tarski’s fixed points,’, Publications of the Research Institute for Mathematical Sciences, 21(5): 1059–1066. (Scholar)
  • Heifetz, A., and Samet, D., 1998, ‘Topology-free typology of beliefs,’ Journal of Economic Theory, 82(2): 324–341. (Scholar)
  • Incurvati, Luca, 2014, ‘The Graph Conception of Set,’ Journal of Philosophical Logic, 43(1): 181–208. (Scholar)
  • Jacobs, B. and Rutten, J., 1997, ‘A Tutorial on (Co)Algebras and (Co)Induction’, in Bulletin of the European Association for Theoretical Computer Science, 62: 222–259. (Scholar)
  • Kurz, A., 2006, ‘Coalgebras and Their Logics’, ACM SIGACT News, 37(2): 57–77. (Scholar)
  • Levy, A., 1979, Basic Set Theory, Berlin: Springer-Verlag. (Scholar)
  • Milius, S., 2005, ‘Completely iterative algebras and completely iterative monads,’ Information and Computation, 196: 1–41. (Scholar)
  • Moss, L., and Viglizzo, I., 2006, ‘Final coalgebras for functors on measurable spaces,’ Information and Computation, 204(4): 610–636. (Scholar)
  • Parsons, C., 1975, ‘What is the iterative conception of set?’, in Hintikka and Butts (eds.), Logic, foundations of mathematics and computability theory (University of Western Ontario Series in the Philosophy of Science, Volume 9: Proceedings of the Fifth International Congress on Logic, Methodology and the Philosophy of Science, University of Western Ontario, London, Ontario, 1975), Dordrecht: Reidel, 1977, Part I, pp. 335–367. (Scholar)
  • Paulson, L., 1999, ‘Final coalgebras as greatest fixed points in ZF set theory,’ Mathematical Structures in Computer Science, 9: 545–567. (Scholar)
  • Pavlovic, D., and M. H. Escardo, 1998, ‘Calculus in Coinductive Form,’ in 13th Annual IEEE Symposium in Logic in Computer Science (LICS 98), Los Alamitos, CA: IEEE, 408–417. doi:10.1109/lics.1998.705675 (Scholar)
  • Rieger, A., 2000, ‘An argument for Finsler-Aczel set theory,’ Mind, 109(434): 241–253. doi:10.1093/mind/109.434.241 (Scholar)
  • Rutten, J., 2000, ‘Universal coalgebra: a theory of systems,’ Theoretical Computer Science, 249(1): 3–80. (Scholar)
  • Turi, D., and Rutten, J., 1998, ‘On the foundations of final semantics: non-standard sets, metric spaces, partial orders,’ Mathematical Structures in Computer Science, 8(5): 481–540. (Scholar)
  • Viglizzo, I., 2005, Coalgebras on measurable spaces, Ph.D. Dissertation, Indiana University, Bloomington. (Scholar)

Generated Mon Jan 24 14:07:32 2022