<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://hdl.handle.net/11089/35156">
<title>Bulletin of the Section of Logic 49/4 (2020)</title>
<link>http://hdl.handle.net/11089/35156</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://hdl.handle.net/11089/35465"/>
<rdf:li rdf:resource="http://hdl.handle.net/11089/35464"/>
<rdf:li rdf:resource="http://hdl.handle.net/11089/35463"/>
<rdf:li rdf:resource="http://hdl.handle.net/11089/35462"/>
</rdf:Seq>
</items>
<dc:date>2026-04-06T22:51:49Z</dc:date>
</channel>
<item rdf:about="http://hdl.handle.net/11089/35465">
<title>Four-valued expansions of Dunn-Belnap's logic (I): Basic characterizations</title>
<link>http://hdl.handle.net/11089/35465</link>
<description>Four-valued expansions of Dunn-Belnap's logic (I): Basic characterizations
Pynko, Alexej P.
Basic results of the paper are that any four-valued expansion L4 of Dunn-Belnap's logic DB4 is de_ned by a unique (up to isomorphism) conjunctive matrix ℳ4 with exactly two distinguished values over an expansion 4 of a De Morgan non-Boolean four-valued diamond, but by no matrix with either less than four values or a single [non-]distinguished value, and has no proper extension satisfying Variable Sharing Property (VSP). We then characterize L4's having a theorem / inconsistent formula, satisfying VSP and being [inferentially] maximal / subclassical / maximally paraconsistent, in particular, algebraically through ℳ4|4's (not) having certain submatrices|subalebras.Likewise, [providing 4 is regular / has no three-element subalgebra] L4 has a proper consistent axiomatic extension if[f] ℳ4 has a proper paraconsistent / two-valued submatrix [in which case the logic of this submatrix is the only proper consistent axiomatic extension of L4 and is relatively axiomatized by the Excluded Middle law axiom]. As a generic tool (applicable, in particular, to both classically-negative and implicative expansions of DB4), we also prove that the lattice of axiomatic extensions of the logic of an implicative matrix ℳ with equality determinant is dual to the distributive lattice of lower cones of the set of all submatrices of ℳ with non-distinguished values.
</description>
<dc:date>2020-12-30T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/11089/35464">
<title>Length Neutrosophic Subalgebras of BCK=BCI-Algebras</title>
<link>http://hdl.handle.net/11089/35464</link>
<description>Length Neutrosophic Subalgebras of BCK=BCI-Algebras
Jun, Young Bae; Khan, Madad; Smarandache, Florentin; Song, Seok-Zun
Given i, j, k ∈ {1,2,3,4}, the notion of (i, j, k)-length neutrosophic subalgebras in BCK=BCI-algebras is introduced, and their properties are investigated. Characterizations of length neutrosophic subalgebras are discussed by using level sets of interval neutrosophic sets. Conditions for level sets of interval neutrosophic sets to be subalgebras are provided.
</description>
<dc:date>2020-12-30T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/11089/35463">
<title>Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations</title>
<link>http://hdl.handle.net/11089/35463</link>
<description>Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations
Niki, Satoru
We continue the investigation of the first paper where we studied logics with various negations including empirical negation and co-negation. We established how such logics can be treated uniformly with R. Sylvan's CCω as the basis. In this paper we use this result to obtain cut-free labelled sequent calculi for the logics.
</description>
<dc:date>2020-12-30T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/11089/35462">
<title>From Intuitionism to Brouwer's Modal Logic</title>
<link>http://hdl.handle.net/11089/35462</link>
<description>From Intuitionism to Brouwer's Modal Logic
Kostrzycka, Zofia
We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication, whereas variables and other positive sentences remain as they are. The proposed translation preserves fragments of the Rieger-Nishimura lattice which is the Lindenbaum algebra of monadic formulas in INT. Unfortunately, INT is not embedded by this mapping into KTB.
</description>
<dc:date>2020-12-30T00:00:00Z</dc:date>
</item>
</rdf:RDF>
