An open research problem: strong completeness of R Kowalski's connection graph proof procedure

From MaRDI portal

(Redirected from An open research problem: strong completeness of R Kowalski's connection graph proof procedure)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_open_research_problem:_strong_completeness_of_R_Kowalski%27s_connection_graph_proof_procedure&oldid=89708705"