<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Bulletin of the Section of Logic 44/1-2 (2015)</title>
<link href="http://hdl.handle.net/11089/9984" rel="alternate"/>
<subtitle/>
<id>http://hdl.handle.net/11089/9984</id>
<updated>2026-04-05T20:39:00Z</updated>
<dc:date>2026-04-05T20:39:00Z</dc:date>
<entry>
<title>Categorical  Abstract  Algebraic  Logic: Referential π-Institutions</title>
<link href="http://hdl.handle.net/11089/17400" rel="alternate"/>
<author>
<name>Voutsadakis, George</name>
</author>
<id>http://hdl.handle.net/11089/17400</id>
<updated>2018-02-01T11:20:34Z</updated>
<published>2015-01-01T00:00:00Z</published>
<summary type="text">Categorical  Abstract  Algebraic  Logic: Referential π-Institutions
Voutsadakis, George
Wójcicki introduced in the late 1970s the concept of a referential semantics for propositional logics. Referential semantics incorporate features of the Kripke possible world semantics for modal logics into the realm of algebraic and matrix semantics of arbitrary sentential logics. A well-known theorem of Wójcicki asserts that a logic has a referential semantics if and only if it is selfextensional. Referential semantics was subsequently studied in detail by Malinowski and the concept of selfextensionality has played, more recently, an important role in the field of abstract algebraic logic in connection with the operator approach to algebraizability. We introduce and review some of the basic definitions and results pertaining to the referential semantics of π-institutions, abstracting corresponding results from the realm of propositional logics.
</summary>
<dc:date>2015-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Closure Operators on Complete Almost Distributive Lattices-III</title>
<link href="http://hdl.handle.net/11089/17399" rel="alternate"/>
<author>
<name>Rao, Calyampudi Radhakrishna</name>
</author>
<author>
<name>Undurthi, Venugopalam</name>
</author>
<id>http://hdl.handle.net/11089/17399</id>
<updated>2018-02-01T11:20:40Z</updated>
<published>2015-01-01T00:00:00Z</published>
<summary type="text">Closure Operators on Complete Almost Distributive Lattices-III
Rao, Calyampudi Radhakrishna; Undurthi, Venugopalam
In this paper, we prove that the lattice of all closure operators of a complete Almost Distributive Lattice L with fixed maximal element m is dual atomistic. We define the concept of a completely meet-irreducible element in a complete ADL and derive a necessary and sufficient condition for a dual atom of Φ(L) to be complemented.
</summary>
<dc:date>2015-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>An Observation Concerning Porte’s Rule in Modal Logic</title>
<link href="http://hdl.handle.net/11089/17398" rel="alternate"/>
<author>
<name>French, Rohan</name>
</author>
<author>
<name>Humberstone, Lloyd</name>
</author>
<id>http://hdl.handle.net/11089/17398</id>
<updated>2018-02-01T11:20:34Z</updated>
<published>2015-01-01T00:00:00Z</published>
<summary type="text">An Observation Concerning Porte’s Rule in Modal Logic
French, Rohan; Humberstone, Lloyd
It is well known that no consistent normal modal logic contains (as theorems) both ◊A and ◊¬A (for any formula A). Here we observe that this claim can be strengthened to the following: for any formula A, either no consistent normal modal logic contains ◊A, or else no consistent normal modal logic contains ◊¬A.
</summary>
<dc:date>2015-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Non-Fregean Logics of Analytic Equivalence (II)</title>
<link href="http://hdl.handle.net/11089/17397" rel="alternate"/>
<author>
<name>Biłat, Andrzej</name>
</author>
<id>http://hdl.handle.net/11089/17397</id>
<updated>2018-02-01T11:20:40Z</updated>
<published>2015-01-01T00:00:00Z</published>
<summary type="text">Non-Fregean Logics of Analytic Equivalence (II)
Biłat, Andrzej
This paper presents the main assumptions of Andrzej Grzegorczyk’s last research project concerning the logic of synonymity. It shows that the basis of logic of analytic equivalence, presented in the ﬁrst part of the work, fully corresponds with these assumptions.
</summary>
<dc:date>2015-01-01T00:00:00Z</dc:date>
</entry>
</feed>
