2011
DOI: 10.1007/s11787-011-0035-4
|View full text |Cite
|
Sign up to set email alerts
|

On Refutation Rules

Abstract: Abstract. The goal of this paper is to generalize specific techniques connected with refutation rules involving certain normal forms. In particular, a method of axiomatizing both a logic L and its complement −L is introduced. Mathematics Subject Classification (2000). Primary 03B22; Secondary 03B45.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 5 publications
(9 reference statements)
0
3
0
Order By: Relevance
“…• A general method for proving completeness with respect to refutation rules involving certain normal forms is presented in [Skura, 2011a].…”
Section: Further General References On Refutation Systemsmentioning
confidence: 99%
“…• A general method for proving completeness with respect to refutation rules involving certain normal forms is presented in [Skura, 2011a].…”
Section: Further General References On Refutation Systemsmentioning
confidence: 99%
“…10 This builds upon analysis of the relationship between intuitionistic and co-intuitionistic logic as discussed in [4,5,7,12,16,35,37,39,52]; and systems of proof and refutation discussed in [41,42,43,44,45,53,54]. Unlike the construction suggested here, the typical relationship between intuitionistic and co-intuitionistic logic in the literature is not without significant 6 Note that this feature is not forced on intuitionistic sequents, though restrictions on rules or dependency relations are required to ensure that only intuitionistic derivations are valid in sequents with multiple conclusions, see [9] for discussion.…”
Section: Bi-intuitionismmentioning
confidence: 99%
“…The complementary systems contain, essentially, two subsystems: one for deriving the asserted propositions, and another -for deriving the rejected propositions. For instance, in [49,50,59] the authors consider two closure operators: the regular one Cn that gives the theorems, and the complementary one Cn − , that gives anti-theorems (see also [45,Section 5.2]).…”
Section: 42mentioning
confidence: 99%