The problem of finding an inference rule for set theory

DOI10.1007/BF00245023zbMath0679.68178OpenAlexW2034137401WikidataQ114267070 ScholiaQ114267070MaRDI QIDQ1823017

Larry Wos

Publication date: 1989

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00245023

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Layered map reasoning ⋮ \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets

This page was built for publication: The problem of finding an inference rule for set theory