Publicação: The method of polynomial ring calculus and its potentialities
Nenhuma Miniatura disponível
Data
2015-01-01
Autores
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Artigo
Direito de acesso
Acesso aberto
Resumo
This 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.
Descrição
Idioma
Inglês
Como citar
Theoretical Computer Science, v. 606, p. 42-56.
