Non-deterministic semantics in polynomial format

DOI10.1016/J.ENTCS.2014.06.003zbMATH Open1335.03012OpenAlexW2091224100WikidataQ113317872 ScholiaQ113317872MaRDI QIDQ281146FDOQ281146

Walter Carnielli, Mariana Matulovic

Publication date: 10 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.06.003

zbMATH Keywords

complexitymany-valued logicssatisfiabilitynondeterministic semanticspolynomial proof systems

Mathematics Subject Classification ID

Many-valued logic (03B50) Polynomials over finite fields (11T06) Mechanization of proofs and logical operations (03B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Logics of Formal Inconsistency
• Intuitive semantics for first-degree entailments and `coupled trees'
• POLYNOMIAL RING CALCULUS FOR MODAL LOGICS: A NEW SEMANTICS AND PROOF METHOD FOR MODALITIES
• Non-deterministic semantics for logics with a consistency operator

Cited In (3)

• Reconciling First-Order Logic to Algebra
• The method of polynomial ring calculus and its potentialities
• Title not available (Why is that?)

This page was built for publication: Non-deterministic semantics in polynomial format

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