O Departamento de Filosofia da UFRN, através da Base de Pesquisa "Lógica, Conhecimento e Ética", dá continuidade a sua programação anual dos Seminários de Lógica e Filosofia Formal, em conjunto com o Grupo de Lógica, Linguagem, Informação, Teoria e Aplicações (LoLITA), com a palestra:
Arbitrary multi-truth-value functions and Natural Deduction Cecilia Englander PUC-RJ Data:25 de Maio de 2012, às 16:00 Local: UFRN, Setor II, sala I5 Abstract Segerberg presented a general completeness proof for propositional logics. For this purpose, a deductive system was defined in a way that its rules were rules for an arbitrary k-place Boolean operator in a given propositional logic. Each of those rules corresponds to a row on the operator’s truth-table. This article extends Segerberg’s idea to finite-valued propositional logic. We maintain the idea of defining a deductive system whose rules correspond to rows of truth-tables, but instead of having n types of rules (one for each truth-value), we use a bivalent representation that use the help of separating formulas as defined by Carlos Caleiro and João Marcos. _______________________________________________ Logica-l mailing list [email protected] http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l
