Satisfiability problem in propositional and renominative composition-nominative logic

zbMATH Open1249.03040MaRDI QIDQ2897511

V. G. Tymofeev

Publication date: 16 July 2012

Published in: Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

validitysatisfiabilitypartial predicatescomposition-nominative logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

STACS 2004 ⋮ Separating signs in the propositional satisfiability problem ⋮ AC complement problems: Satisfiability and negation elimination ⋮ The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic

This page was built for publication: Satisfiability problem in propositional and renominative composition-nominative logic

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