From cut-free calculi to automated deduction: the case of bounded contraction

Autores		Ciabattoni, Agata; Lellmann, Bjorn; Vega, Carlos Alberto Olarte; Pimentel, Elaine Gouvea
Editor		Elsevier
Data		2017
Palavras-chave		Proof theory Substructural logics Proof search Bounded contraction
Citação		CIABATTONI, Agata; LELLMANN, Björn; OLARTE, Carlos; PIMENTEL, Elaine. From Cut-free Calculi to Automated Deduction: the case of bounded contraction. Electronic Notes in Theoretical Computer Science, [S.L.], v. 332, p. 75-93, jun. 2017. Disponível em: https://www.researchgate.net/publication/317825238_From_Cut-free_Calculi_to_Automated_Deduction_The_Case_of_Bounded_Contraction. Acesso em: 29 jul. 2020. http://dx.doi.org/10.1016/j.entcs.2017.04.006.
Resumo
URI		https://repositorio.ufrn.br/jspui/handle/123456789/29757