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

• Autor(a) principal: Ciabattoni, Agata
• Data de Publicação: 2017
• Outros Autores: Lellmann, Bjorn, Vega, Carlos Alberto Olarte, Pimentel, Elaine Gouvea
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UFRN
• Texto Completo: https://repositorio.ufrn.br/jspui/handle/123456789/29757
• topic: Proof theory; Substructural logics; Proof search; Bounded contraction

The addition of the bounded contraction rules to Full Lambek Calculus with exchange and weakening (FLew) gives rise to serious complications for proof search. For example, adding to FLew a naive version of these rules brakes cut-admissibility. Although this can be avoided by refining these rules, in this work we show that even “good” proof systems for FLew plus bounded contraction do not necessarily lead to good implementations. In order to solve this problem, we propose an extension of the lazy splitting methodology to bounded contractions, showing how to transform our focused, cut-free sequent calculus into a terminating theorem prover. Our system is used to show that the decision problem for FLew with bounded contraction is in EXPTIME