Automated reasoning about elementary point-set topology (Q1122363): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:16, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automated reasoning about elementary point-set topology |
scientific article |
Statements
Automated reasoning about elementary point-set topology (English)
0 references
1989
0 references
The authors use a first-order formulation of point set topology using sorted logic where one has three types of objects: viz., points, sets of points and collections of sets of points. The use of typed variables, however, presents difficulties when one applies automated reasoning. The authors try to get around this difficulty by using ``implicit typing'' where the position of an argument determines its type. Using this formal framework the authors describe the basic notions of point set topology and they give a resolution proof of the fact that a basis generates a topology with that basis.
0 references
automated reasoning
0 references
set theory
0 references
resolution
0 references
topology
0 references
sorted logic
0 references