\({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations (Q1319387): Difference between revisions

@@ Property / cites work @@
+A \(\lambda\)-unifiability test for set theory
@@ Property / cites work: A \(\lambda\)-unifiability test for set theory / rank @@
+Normal rank
@@ Property / cites work @@
+Towards the automation of set theory and its logic
+Normal rank
@@ Property / cites work @@
+Man-machine theorem proving in graph theory
@@ Property / cites work: Man-machine theorem proving in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Human Oriented Logic for Automatic Theorem-Proving
+Normal rank
@@ Property / cites work @@
+A relaxation approach to splitting in an automatic theorem prover
+Normal rank
@@ Property / cites work @@
+A Machine-Oriented Logic Based on the Resolution Principle
+Normal rank
@@ Property / cites work @@
+Q3742689
@@ Property / cites work: Q3742689 / rank @@
+Normal rank
@@ Property / cites work @@
+The problem of finding an inference rule for set theory
+Normal rank