1973
DOI: 10.1007/bf02123824
|View full text |Cite
|
Sign up to set email alerts
|

Proof of Ł-decidability of Lewis system S5

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
9
0

Year Published

1983
1983
2020
2020

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 2 publications
0
9
0
Order By: Relevance
“…Slupecki, Bryll, Wybraniec-Skardowska and others from Slupecki's school developed a general theory, in Tarski's style, of rejected propositions and investigated in detail the properties of the corresponding consequence relation (see [17] , [18]) . Also, Slupecki and Bryll [16] constructed a complete refutation system for the propositional modal logic S5, and Bryll and Maduch [2] proposed refutation axioms for Lukasiewicz's many-valued logics.…”
mentioning
confidence: 99%
“…Slupecki, Bryll, Wybraniec-Skardowska and others from Slupecki's school developed a general theory, in Tarski's style, of rejected propositions and investigated in detail the properties of the corresponding consequence relation (see [17] , [18]) . Also, Slupecki and Bryll [16] constructed a complete refutation system for the propositional modal logic S5, and Bryll and Maduch [2] proposed refutation axioms for Lukasiewicz's many-valued logics.…”
mentioning
confidence: 99%
“…and the set 3 T − S of all rejected propositions of S with respect to the set T + S and the basis (B S ), on the analogy to D(Sł), can be defined as follows: [43], Słupecki and Bryll [44], Wybraniec-Skardowska [63,64]).…”
Section: Three Different Notions Of Rejectionmentioning
confidence: 99%
“…Afterwards, Słupecki initiated research on Ł-decidability of Lewis system S5. In his and Bryll's paper [44], the proof of Ł-decidability was achieved with an assumption of one rejected axiom (the prepositional variable p) and, apart from Łukasiewicz's rules, a class of rejection rules of the common scheme.…”
Section: Modal Logicmentioning
confidence: 99%
“…Perhaps the easiest route to a generalization is to draw on the work of Słupecki and Bryll [15]. They pursue the old idea of the Polish school that a logic should have in addition to its axioms and rules of the ordinary kind, its axioms and rules of acceptance, indicating that certain formulas are acceptable as general laws, some axioms and rules of an opposite kind, axioms and rules of rejection, indicating that certain formulas are unacceptable as general laws.…”
Section: Against Mckmentioning
confidence: 99%