Bulletin of the Section of Logic 46/3-4 (2017)
http://hdl.handle.net/11089/25016
2024-03-03T18:17:35ZAn Inferentially Many-Valued Two-Dimensional Notion of Entailment
http://hdl.handle.net/11089/25179
An Inferentially Many-Valued Two-Dimensional Notion of Entailment
Blasio, Carolina; Marcos, João; Wansing, Heinrich
Starting from the notions of q-entailment and p-entailment, a two-dimensional notion of entailment is developed with respect to certain generalized q-matrices referred to as B-matrices. After showing that every purely monotonic singleconclusion consequence relation is characterized by a class of B-matrices with respect to q-entailment as well as with respect to p-entailment, it is observed that, as a result, every such consequence relation has an inferentially four-valued characterization. Next, the canonical form of B-entailment, a two-dimensional multiple-conclusion notion of entailment based on B-matrices, is introduced, providing a uniform framework for studying several different notions of entailment based on designation, antidesignation, and their complements. Moreover, the two-dimensional concept of a B-consequence relation is defined, and an abstract characterization of such relations by classes of B-matrices is obtained. Finally, a contribution to the study of inferential many-valuedness is made by generalizing Suszko’s Thesis and the corresponding reduction to show that any B-consequence relation is, in general, inferentially four-valued.
2017-01-01T00:00:00ZLogics with Impossibility as the Negation and Regular Extensions of the Deontic Logic D2
http://hdl.handle.net/11089/25180
Logics with Impossibility as the Negation and Regular Extensions of the Deontic Logic D2
Mruczek-Nasieniewska, Krystyna; Nasieniewski, Marek
In [1] J.-Y. Bèziau formulated a logic called Z. Bèziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been shown in [6] and [7] that there is a correspondence between normal modal logics and logics from the class K. Similar; but only partial results has been obtained also for regular logics (see [8] and [9]). In (Došen; [2]) a logic N has been investigated in the language with negation; implication; conjunction and disjunction by axioms of positive intuitionistic logic; the right-to-left part of the second de Morgan law; and the rules of modus ponens and contraposition. From the semantical point of view the negation used by Došen is the modal operator of impossibility. It is known this operator is a characteristic of the modal interpretation of intuitionistic negation (see [3; p. 300]). In the present paper we consider an extension of N denoted by N+. We will prove that every extension of N+ that is closed under the same rules as N+; corresponds to a regular logic being an extension of the regular deontic logic D21 (see [4] and [13]). The proved correspondence allows to obtain from soundnesscompleteness result for any given regular logic containing D2, similar adequacy theorem for the respective extension of the logic N+.
2017-01-01T00:00:00ZOn Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2
http://hdl.handle.net/11089/25177
On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2
Pietruszczak, Andrzej
This is the second, out of two papers, in which we identify all logics between C1 and S5 having the same theses without iterated modalities. All these logics can be divided into certain groups. Each such group depends only on which of the following formulas are theses of all logics from this group: (N), (T), (D), ⌜(T)∨☐q⌝, and for any n 0 a formula ⌜(T) ∨ (altn)⌝, where (T) has not the atom ‘q’, and (T) and (altn) have no common atom. We generalize Pollack’s result from [1], where he proved that all modal logics between S1 and S5 have the same theses which does not involve iterated modalities (i.e., the same first-degree theses).
2017-01-01T00:00:00ZA Syntactic Approach to Closure Operation
http://hdl.handle.net/11089/25178
A Syntactic Approach to Closure Operation
Nowak, Marek
In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic characteristic of a closure operation defined on a complete lattice follows. The approach is based on observation that the role of rule of inference for a given consequence operation may be played by an ordinary binary relation on the complete lattice on which the closure operation is defined.
2017-01-01T00:00:00Z