Publication Details
Title: On the Decidability Problem for a Topological Syllogistic Involving the Notion of Topological Product
Author: D. Cantone and V. Cutello
Group: ICSI Technical Reports
Date: May 1991
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-91-029.pdf
Overview:
A two-level, multi-sorted language of sets with cartesian product is introduced. The solvability of the satisfiability problem for the corresponding class of unquantified formulae is shown to be useful in order to automatically verify the validity of certain topological statements involving the notion of product of spaces.
Author: D. Cantone and V. Cutello
Group: ICSI Technical Reports
Date: May 1991
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-91-029.pdf
Overview:
A two-level, multi-sorted language of sets with cartesian product is introduced. The solvability of the satisfiability problem for the corresponding class of unquantified formulae is shown to be useful in order to automatically verify the validity of certain topological statements involving the notion of product of spaces.
The underlying motivation for this study is to enrich the class of theoretical results that can be used for a set-theoretic proof verifier.
Bibliographic Information:
ICSI Technical Report TR-91-029
Bibliographic Reference:
D. Cantone and V. Cutello. On the Decidability Problem for a Topological Syllogistic Involving the Notion of Topological Product. ICSI Technical Report TR-91-029, May 1991