scientific article; zbMATH DE number 4164193

MaRDI QIDQ3491017zbMATH OpenFDO

Authors Domenico Cantone, Eugenio Omodeo

Publication date 1989

zbMATH Keywords

satisfiability problemset theorytopologytwo-level multi-sorted language

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness, and cardinality comparison
• Further generalizations of results on structures of continuous functions
• Techniques of computable set theory with applications to proof verification
• Topological syllogistic with continuous and closed functions
• scientific article; zbMATH DE number 4091462

Cited in

(3)

• Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness, and cardinality comparison
• Fluted formulas and the limits of decidability
• Decidable fan theorem and uniform continuity theorem with continuous moduli

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491017)