"Completeness Proofs for Propositional Logic with Polynomial-Time Connectives."

John N. Crossley, Philip J. Scott (1989)

Details and statistics

DOI: 10.1016/0168-0072(89)90044-4

access: closed

type: Journal Article

metadata version: 2020-02-21

a service of  Schloss Dagstuhl - Leibniz Center for Informatics