Propositional sequence-calculi for inconsistent systems.

Raggio, Andrés R.

doi:10.1305/ndjfl/1093893524

Cited by 21 publications

(12 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…13]). A few years later, A. R. Raggio,in 38], tried to formulate a Gentzen-type sequent system, but did not succeed. It was only recently that J.-Y.…”

Section: Historical Aspectsmentioning

confidence: 99%

Aspects of Paraconsistent Logic

1995

View full text Add to dashboard Cite

“…13]). A few years later, A. R. Raggio,in 38], tried to formulate a Gentzen-type sequent system, but did not succeed. It was only recently that J.-Y.…”

Section: Historical Aspectsmentioning

confidence: 99%

Aspects of Paraconsistent Logic

1995

View full text Add to dashboard Cite

“…At first, most of the efforts towards finding such calculi concentrated on da Costa's historical system C 1 . After an aborted attempt by Raggio in the sixties ( [34]), Beziau proposed in [14] somewhat peculiar sequent rules for C 1 , using an intuitive translation of certain semantical conditions. Later he proved a general completeness theorem which explains why this intuitive translation works.…”

Section: Introductionmentioning

confidence: 99%

Cut-free sequent calculi for C-systems with generalized finite-valued semantics

Avron¹,

Konikowska²,

Zamansky³

2012

Journal of Logic and Computation

View full text Add to dashboard Cite

In [5], a general method was developed for generating cut-free ordinary sequent calculi for logics that can be characterized by finite-valued semantics based on non-deterministic matrices (Nmatrices). In this paper, a substantial step towards automation of paraconsistent reasoning is made by applying that method to a certain crucial family of thousands of paraconsistent logics, all belonging to the class of C-systems. For that family, the method produces in a modular way uniform Gentzen-type rules corresponding to a variety of axioms considered in the literature.

show abstract

“…The system LK + ({(⇒ ¬), (¬¬ ⇒)}) is the logic C min studied in [16]. [34]) of da Costa's well-known logic C ω (see [19]). …”

Section: ⇒ ¬Ffmentioning

confidence: 99%