Sobre o conceito semântico de satisfação

• Ano de defesa: 2015
• Autor(a) principal: Alves, Carlos Roberto Teixeira
• Orientador(a): Ibri, Ivo Assad
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Pontifícia Universidade Católica de São Paulo
• Programa de Pós-Graduação: Programa de Estudos Pós-Graduados em Filosofia
• Departamento: Filosofia
• País: BR
• Palavras-chave em Português: Satisfatibilidade; Tarski; Lógica de primeira ordem; Sequências finitas; Estruturas relacionais; Critérios de satisfação
• Palavras-chave em Inglês: Satisfiability; Tarski; First-order logic; Finite sequences; Relational structures; Criteria s satisfaction
• Área do conhecimento CNPq: CNPQ::CIENCIAS HUMANAS::FILOSOFIA
• Link de acesso: https://tede2.pucsp.br/handle/handle/11703

This work aims to show the current treatment of the semantic notion of satisfiability to the logic of the first order, the relevant problems of Tarski's solution to define this notion - in this case, the use of infinite sequences to satisfy the formulas - and propose an alternative to circumvent this problem. The notion established by Tarski became, in discussions on the subject, standard solution and resulted in rich tools to work with the languages, in particular tools such as the Theory of Models. However, from a philosophical point of view, it is very important to broaden perspectives and look at the problem from a new dimension. Our proposal is to avoid the counterintuitive idea of using infinite sequences of objects to satisfy the finite formulas, knowing that these infinite sequences are composed almost entirely of 'superfluous terms', expendable in the process of satisfaction, but they should and are listed and indexed in the process. It would be interesting to solve the issue involving sequences without 'superfluous terms'. We propose a structure of first-order language that dispenses variables and constants. The notion of satisfaction in this case is distinct, which increases the possibilities and provides an alternative to the satisfaction of infinite sequences. In the end, we show how our solution can produce the satisfaction of formulas of a first-order language within a framework where satisfaction is interpreted according to certain specific criteria and can be performed by finite sequences, differing essentially from Tarski solution