Satisfiability problem in composition-nominative logics of quantifier-equational level with weak equality

MaRDI QIDQ2850242zbMATH OpenFDO

Authors V. G. Tymofeev

Publication date 26 September 2013

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

zbMATH Keywords

composition-nominative logicspartial predicatessatisfiability

Mathematics Subject Classification ID

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

Recommendations

• Satisfiability in composition-nominative logics
• Satisfiability problem in propositional and renominative composition-nominative logic
• Renominative composition-nominative logics with predicates of equality
• First-order composition-nominative logics
• Composition nominative first order logics

Cited in

(2)

• Satisfiability in composition-nominative logics
• Satisfiability problem in propositional and renominative composition-nominative logic

This page was built for publication: Satisfiability problem in composition-nominative logics of quantifier-equational level with weak equality

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