The Faithfulness Problem

• Autor(a) principal: Bacelar Valente, Mario
• Data de Publicação: 2022
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Principia (Florianópolis. Online)
• Texto Completo: https://periodicos.ufsc.br/index.php/principia/article/view/84395
• topic: Euclidean proof; formal proof; deductive reasoning; suppression task

When adopting a sound logical system, reasonings made within this system are correct. The situation with reasonings expressed, at least in part, with natural language is much more ambiguous. One way to be certain of the correctness of these reasonings is to provide a logical model of them. To conclude that a reasoning process is correct we need the logical model to be faithful to the reasoning. In this case, the reasoning inherits, so to speak, the correctness of the logical model. There is a weak link in this procedure, which we call the faithfulness problem: how do we decide that the logical model is faithful to the reasoning that it is supposed to model? That is an issue external to logic, and we do not have rigorous formal methods to make the decision. The purpose of this paper is to expose the faithfulness problem (not to solve it). For that purpose, we will consider two examples, one from the geometrical reasoning in Euclid’s Elements and the other from a study on deductive reasoning in the psychology of reasoning.