A compendium of continuous lattices in Mizar. Formalizing recent mathematics

Journal of Automated Reasoning

Volumn 29, Issue 3-4, 2002, Pages 189-224

  Bancerek, Grzegorz ^a,b   Rudnicki, Piotr ^c  

^a BIALYSTOK UNIVERSITY OF TECHNOLOGY   (Poland)

^b SHINSHU UNIVERSITY   (Japan)

^c UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Formalization of mathematics; Mathematical knowledge management; Mizar; Proof checking; QED project; Set theory; Theory of continuous lattices

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; SET THEORY; THEOREM PROVING; TOPOLOGY;

COMPENDIUM OF CONTINUOUS LATTICES; PROOF CHECKING;

COMPUTER SCIENCE;

EID: 0036983091     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021966832558     Document Type: Article

References (60)

1. Bancerek, G.: Tarski's classes and ranks, Formalized Mathematics 1(3) (1990), 563-567, MML: CLASSES1.
2. Bancerek, G.: König's theorem, Formalized Mathematics 1(3) (1990), 589-593. MML: CARD_3.
3. Bancerek, G.: Complete lattices, Formalized Mathematics 2(5) (1991), 719-725. MML: LATTICE3.
4. Bancerek, G.: Bounds in posets and relational substructures, Formalized Mathematics 6(1) (1997), 81-91. MML: YELLOW_0.
5. Bancerek, G.: Directed sets, nets, ideals, filters, and maps, Formalized Mathematics 6(1) (1997), 93-107. MML: WAYBEL_0.
6. Bancerek, G.: The "way-below" relation, Formalized Mathematics 6(1) (1997), 169-176, MML: WAYBEL_3.
7. Bancerek, G.: Duality in relation structures, Formalized Mathematics 6(2) (1997), 227-232. MML: YELLOW_7.
8. Bancerek, G.: Prime ideals and filters, Formalized Mathematics 6(2) (1997), 241-247. MML: WAYBEL_7.
9. Bancerek, G.: Bases and refinements of topologies, Formalized Mathematics 7(1) (1968), 35-43. MML: YELLOW_9.
10. Bancerek, G.: The Lawson topology, Formalized Mathematics 7(2) (1998), 163-168. MML: WAYBEL19.
11. Bancerek, G.: Lawson topology in continuous lattices, Formalized Mathematics 7(2) (1998), 177-184. MML:WAYBEL21.
12. Bancerek, G.: Development of the theory of continuous lattices in Mizar, in M. Kerber and M. Kohlhase (eds), Symbolic Computation and Automated Reasoning, A. K. Peters, 2001.
13. 0 spaces, Formalized Mathematics 9(1) (2001), 111-117. MML: WAYBEL26.
14. Bancerek, G.: Categorial background for duality theory, Formalized Mathematics 9(4) (2001), 755-765. MML: YELLOW21.
15. Bancerek, G.: Duality based on the Galois connection. Part I, Formalized Mathematics 9(4) (2001), 767-778. MML: WAYBEL34.
16. Bancerek, G., Endou, N. and Shidama, Y.: Lim-inf convergence and its compactness, Mechanized Mathematics and Its Applications 2(1) (2002), 29-35.
17. Byliński, C.: Some basic properties of sets, Formalized Mathematics 1(1) (1990), 47-53. MML:ZFMISC_1.
18. Byliński, C.: Introduction to categories and functors, Formalized Mathematics 1(2) (1990), 409-420. MML: CAT_1.
19. Byliński, C.: Category ens, Formalized Mathematics 2(4) (1991), 527-533. MML: ENS_1.
20. Byliński, C.: Galois connections, Formalized Mathematics 6(1) (1997), 131-143. MML: WAYBEL_1.
21. Byliński, C. and Rudnicki, P.: The Scott topology. Part II, Formalized Mathematics 6(3) (1997), 441-446. MML: WAYBEL14.
22. Fleuriot, J. and Paulson, L. C.: A combination of nonstandard analysis and geometry theorem proving, with application to Newton's Principia, in C. Kirchner and H. Kirchner (eds), 15th International Conf. on Automated Deduction: CADE-15, LNAI 1421, Springer, 1998, pp. 3-16.
23. Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. W. and Scott, D. S.: A Compendium of Continuous Lattices, Springer-Verlag, Berlin, 1980.
24. Grabowski, A. and Milewski, R.: Boolean posets, posets under inclusion and products of relational structures, Formalized Mathematics 6(1) (1997), 117-121. MML: YELLOW_1
25. Gryko, J.: Injective spaces, Formalized Mathematics 7(1) (1998), 57-62. MML: WAYBELL18.
26. Jaśkowski, S.: On the Rules of Supposition in Formal Logic, Studia Logica, Warsaw University, 1934. Reprinted in S. McCall, Polish Logic in 1920-1939, Clarendon Press, Oxford.
27. Johnstone, P. T.: Stone Spaces, Cambridge University Press, Cambridge, 1982.
28. van Benthem Jutting, L. S.: Checking Landau's "Grundlagen" in the Automath system, Ph.D. thesis, The Eindhoven, 1977.
29. Kelley, J. L.: General Topology, Van Nostrand, New York, 1955.
30. Kornillowicz, A.: Cartesian products of relations and relational structures, Formalized Mathematics 6(1) (1997), 145-152, MML: YELLOW_3.
31. Kornillowicz, A.: On the topological properties of meet-continuous lattices, Formalized Mathematics 6(2) (1997), 269-277. MML: WAYBEL_9.
32. Landau, E. G. H.: Grundlagen der Analysis, Akademische Verlag, Leipzig, 1930.
33. Library Committee of the Association of Mizar Users. Preliminaries to Structures, JFM, Addenda. MML: STRUCT_0.
34. Library Committee of the Association of Mizar Users. Preliminaries to Arithmetic, JFM, Addenda. MML: ARYTM.
35. Mizar Manuals. http://mizar.org/project/bibliography.html.
36. Madras, B.: Product of family of universal algebras, Formalized Mathematics 4(1) (1993), 103-108. MML: PRALG_1.
37. Milewski, R.: Algebraic lattices, Formalized Mathematics 6(2) (1997), 249-254, MML: WAYBEL_8.
38. Nederpelt, R. P., Geuvers, J. H. and de Vrijer, R. C.: Selected Papers on Automath, North-Holland, Amsterdam, 1994.
39. Nipkow, T.: Winskel is (almost) right: Towards a mechanized semantics textbook, Formal Aspects of Computing 10 (1998), 171-186.
40. Padlewska, B. and Darmochwal, A. Topological spaces and continuous functions, Formalized Mathematics 1(1) (1990), 223-230, MML: PRE_TOPC.
41. Paulson, L.C. and Gra̧bczewski, K., Mechanizing set theory: Cardinal arithmetic and the axiom of choice, J. Automated Reasoning 17(1996), 291-323.
42. Rasiowa, H. and Sikowski, R. The Mathematics of Metamathematics, PWN, Warszawa, 1968.
43. Rudnicki, P., Kernel projections and quotient lattices, Formalized Mathematics 7(2) (1998), 169-175, MML: WAYBEL20.
44. Rudnicki, P., Schwarzweller, Ch. and Trybulec, A. Commutative algebra in the Mizar system, J. Symbolic Comput. 32(2001), 143-169.
45. Rudnicki, P. and Trybulec, A.: On equivalents of well-foundedness, J. Automated Reasoning 23(3-4) (1999), 197-234.
46. Rudnicki, P. and Trybulec, A.: Mathematical knowledge management in MIZAR 1st Int. Workshop on MKM, Sept. 24-26, 2001. http://www.risc.uni-linz.ac.at/institute/conferences/MKM2001.
47. Shibakov, A. Yu, and Trybulec, A.: The Cantor set, Formalized Mathematics 5(2) (1996), 233-236. MML:CANTOR_1.
48. Trybulec, A.: Tarski Grothendieck set theory, Formalized Mathematics 1(1) (1990), 9-11. MML:TARSKI.
49. Trybulec, A.: Built-in concepts, Formalized Mathematics 1(1) (1990), 13-15, MML:AXIOMS.
50. Trybulec, A., Categories without uniqueness of cod and dom, Formalized Mathematics 5(2) (1996), 259-267, MML:ALTCAT_1.
51. Trybulec, A., Functors for alternative categories, Formalized Mathematics 5(4) (1996), 595-608, MML:FUNCTORO.
52. Trybulec, A.: Moore-Smith convergence, Formalized Mathematics 6(2) (1997), 213-225.
53. Trybulec, A., Scott topology, Formalized Mathematics 6(2) (1997), 311-319, MML:WAYBEL11.
54. Trybulec, W. A.: Partially ordered sets, Formalized Mathematics 1(2) (1990), 313-319, MML:ORDERS_1.
55. Trybulec, Z. and Świȩczkowska, H.: Boolean properties of sets, Formalized Mathematics 1(1) (1990), 17-23, MML:BOOLE.
56. Wiedijk, F.: Mizar: An impression. http://www.cs.kun.nl/~freek/notes
57. Wiedijk, F.; Estimating the cost of a standard library for a mathematical proof checker. http://www.cs.kun.nl./~freek/notes
58. Wiedijk, F.; The de Bruijn factor. http://www.cs.kun.n1/~freek/notes
59. Woronowicz, E. and Zalewska, A., Properties of binary relations, Formalized Mathematics 1(1) (1990), 85-89, MML:RELAT_2
60. Zukowski, S.: Introduction to lattice theory, Formalized Mathematics 1(1) (1990), 215-222. MML:LATTICES