The method of polynomial ring calculus and its potentialities

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.creatorCarnielli, Walter-
Autor(es): dc.creatorMatulovic, Mariana-
Data de aceite: dc.date.accessioned2021-03-11T00:28:37Z-
Data de disponibilização: dc.date.available2021-03-11T00:28:37Z-
Data de envio: dc.date.issued2018-12-11-
Data de envio: dc.date.issued2018-12-11-
Data de envio: dc.date.issued2015-01-01-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1016/j.tcs.2015.05.015-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/168160-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/168160-
Descrição: dc.descriptionThis paper surveys some results on the role of formal polynomials as a representation method for logical derivation in classical and non-classical logics, emphasizing many-valued logics, paraconsistent logics and non-deterministic logics, as well as their potentialities for alternative algebraic representation and for automation. The resulting mechanizable proof method exposed here is of interest for automatic proof theory, as the proof methods are comparable to analytic tableaux in generality and intuitiveness, and seems also to indicate a new avenue for investigating questions on complexity.-
Formato: dc.format42-56-
Idioma: dc.languageen-
Relação: dc.relationTheoretical Computer Science-
Relação: dc.relation0,488-
Direitos: dc.rightsopenAccess-
Palavras-chave: dc.subjectDeterministic and non-deterministic many-valued logics-
Palavras-chave: dc.subjectFinite fields-
Palavras-chave: dc.subjectParaconsistency-
Palavras-chave: dc.subjectPolynomial proof systems-
Título: dc.titleThe method of polynomial ring calculus and its potentialities-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.