Non-deterministic semantics in polynomial format

DOI10.1016/J.ENTCS.2014.06.003zbMath1335.03012OpenAlexW2091224100WikidataQ113317872 ScholiaQ113317872MaRDI QIDQ281146

Mariana Matulovic, Walter Alexandre Carnielli

Publication date: 10 May 2016

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

zbMATH Keywords

complexitysatisfiabilitymany-valued logicsnondeterministic semanticspolynomial proof systems

Mathematics Subject Classification ID

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

Related Items (2)

The method of polynomial ring calculus and its potentialities ⋮ Reconciling First-Order Logic to Algebra

Cites Work

• Non-deterministic semantics for logics with a consistency operator
• Intuitive semantics for first-degree entailments and `coupled trees'
• POLYNOMIAL RING CALCULUS FOR MODAL LOGICS: A NEW SEMANTICS AND PROOF METHOD FOR MODALITIES
• Logics of Formal Inconsistency
• Unnamed Item
• Unnamed Item

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