Satisfiability problem in propositional and renominative composition-nominative logic

MaRDI QIDQ2897511zbMATH OpenFDO

Authors 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

composition-nominative logicspartial predicatessatisfiabilityvalidity

Mathematics Subject Classification ID

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

Recommendations

• Satisfiability in composition-nominative logics
• Satisfiability problem in composition-nominative logics of quantifier-equational level with weak equality
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
• First-order composition-nominative logics
• Introduction to propositional satisfiability

Cited in

(6)

• Separating signs in the propositional satisfiability problem
• Satisfiability in composition-nominative logics
• Satisfiability problem in composition-nominative logics of quantifier-equational level with weak equality
• The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
• AC complement problems: Satisfiability and negation elimination
• STACS 2004

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)