Topic
Paraconsistent logic
About: Paraconsistent logic is a research topic. Over the lifetime, 1610 publications have been published within this topic receiving 28842 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The authors have been partially supported by the FP7-PEOPLE-2009-IRSES project MaToMUVI and the MINECO project TIN2012-39348-C02-01.
Abstract: The authors have been partially supported by the FP7-PEOPLE-2009-IRSES project MaToMUVI (PIRSES-GA-2009-247584). Coniglio was also supported by FAPESP (Thematic Project LogCons 2010/51038-0), and by a research grant from
CNPq (PQ 305237/2011-0). Esteva and Godo also acknowledge partial support by the MINECO project TIN2012-39348-C02-01
21 citations
••
21 citations
••
01 Jan 1995TL;DR: The Helsinki Logic Group in infinitary logic as discussed by the authors used trees and Ehrenfeucht-Fraisse games to measure differences between uncountable models, which can be expressed by sentences of the so-called infinitely deep languages.
Abstract: We describe the work and underlying ideas of the Helsinki Logic Group in infinitary logic. The central idea is to use trees and Ehrenfeucht-Fraisse games to measure differences between uncountable models. These differences can be expressed by sentences of the so-called infinitely deep languages. This study has ramified to purely set-theoretical problems related to properties of trees, descriptive set theory in ω1ω1, a detailed study of transfinite Ehrenfeucht-Fraisse games, new constructions of uncountable models, non-well-founded induction, infinitely deep languages, non-structure theorems, and stability theory. The aim of this paper is to give an overview of the underlying ideas of this reasearch together with a survey of the main results.
21 citations
••
TL;DR: It is shown that the logic LP cannot dene a binary connective obeying detachment in the sense that every valuation satisfying ' and ' also satises , except trivially, as a corollary of a more general result concerning variable-sharing.
Abstract: We shed light on an old problem by showing that the logic LP cannot dene a binary connective obeying detachment in the sense that every valuation satisfying ' and ' also satises , except trivially We derive this as a corollary of a more general result concerning variable-sharing
21 citations