The method of polynomial ring calculus and its potentialities

DOI10.1016/j.tcs.2015.05.015zbMath1338.03012OpenAlexW336522774MaRDI QIDQ897932

Mariana Matulovic, Walter Alexandre Carnielli

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.015

zbMATH Keywords

finite fieldsmany-valued logicspolynomial proof systemsparaconsistent logicsformal polynomialslogical derivationnon-deterministic logics

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50) Paraconsistent logics (03B53)

Related Items (3)

On polynomial semantics for propositional logics ⋮ Tree-like proof systems for finitely-many valued non-deterministic consequence relations ⋮ Polynomial semantics for modal logics

Cites Work

• Non-deterministic semantics in polynomial format
• Non-deterministic semantics for logics with a consistency operator
• The Fregean axiom and Polish mathematical logic in the \(1920^s\)
• Intuitive semantics for first-degree entailments and `coupled trees'
• POLYNOMIAL RING CALCULUS FOR MODAL LOGICS: A NEW SEMANTICS AND PROOF METHOD FOR MODALITIES
• How to use finite fields for problems concerning infinite fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The method of polynomial ring calculus and its potentialities