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

From MaRDI portal
(Redirected from Publication:4532365)















This page was built for publication: An open research problem: strong completeness of R Kowalski's connection graph proof procedure

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