Pages that link to "Item:Q636273"

From MaRDI portal

← Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273)

Jump to:navigation, search

The following pages link to Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273):

Displaying 2 items.

Completeness in PVS of a nominal unification algorithm (Q1744405) (← links)
On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic (Q1933772) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere"