2018
DOI: 10.1007/s11787-018-0184-9
|View full text |Cite
|
Sign up to set email alerts
|

A Characterisation of Some $$\mathbf {Z}$$ Z -Like Logics

Abstract: Abstract. In Béziau (Log Log Philos 15:99-111, 2006) a logic Z was defined with the help of the modal logic S5. In it, the negation operator is understood as meaning 'it is not necessary that'. The strong soundnesscompleteness result for Z with respect to a version of Kripke semantics was also given there. Following the formulation of Z we can talk about Z-like logics or Beziau-style logics if we consider other modal logics instead of S5-such a possibility has been mentioned in [1]. The correspondence result b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 4 publications
1
4
0
Order By: Relevance
“…In the present paper we strengthen observations given in [10] using only impossibility connective. The smallest logic N + that we are using here, is an extension of the mentioned logic N. The new translations presented in the current paper allow directly for obtaining an extension of N + from any regular extension of the deontic logic D2.…”
Section: Introductionsupporting
confidence: 91%
See 4 more Smart Citations
“…In the present paper we strengthen observations given in [10] using only impossibility connective. The smallest logic N + that we are using here, is an extension of the mentioned logic N. The new translations presented in the current paper allow directly for obtaining an extension of N + from any regular extension of the deontic logic D2.…”
Section: Introductionsupporting
confidence: 91%
“…Let us recall a class of logics considered in [10]: Definition 2. Let R∼ ∼ be the class of all logics that are non-trivial subsets of For∼ ∼ , containing the full positive classical logic in the language {∧, ∨, →}, including the following formulas:…”
Section: Logics Corresponding To Regular Extensions Of D2mentioning
confidence: 99%
See 3 more Smart Citations