Bulletin of the Section of Logic 47/1 (2018)http://hdl.handle.net/11089/263492020-02-23T17:44:46Z2020-02-23T17:44:46ZAlgebraic Characterization of the Local Craig Interpolation PropertyGyenis, Zalánhttp://hdl.handle.net/11089/264112019-03-21T02:17:44Z2018-01-01T00:00:00ZAlgebraic Characterization of the Local Craig Interpolation Property
Gyenis, Zalán
The sole purpose of this paper is to give an algebraic characterization, in terms of a superamalgamation property, of a local version of Craig interpolation theorem that has been introduced and studied in earlier papers. We continue ongoing research in abstract algebraic logic and use the framework developed by Andréka–Németi and Sain.
2018-01-01T00:00:00ZApplications of Algebra in Logic and Computer Science – the Past and the FutureGrygiel, Joannahttp://hdl.handle.net/11089/264122019-03-21T02:17:43Z2018-01-01T00:00:00ZApplications of Algebra in Logic and Computer Science – the Past and the Future
Grygiel, Joanna
We present the history of the conference Applications of Algebra in Logic and Computer Science, whose twenty-third edition will be held in March, 2019. At the end we outline some plans for the future.
2018-01-01T00:00:00ZPC-lattices: A Class of Bounded BCK-algebrasShoar, Sadegh KhosraviBorzooei, Rajab AliMoradian, R.Radfar, Atefehttp://hdl.handle.net/11089/264102019-03-21T02:17:42Z2018-01-01T00:00:00ZPC-lattices: A Class of Bounded BCK-algebras
Shoar, Sadegh Khosravi; Borzooei, Rajab Ali; Moradian, R.; Radfar, Atefe
In this paper, we define the notion of PC-lattice, as a generalization of finite positive implicative BCK-algebras with condition (S) and bounded commutative BCK-algebras. We investiate some results for Pc-lattices being a new class of BCK-lattices. Specially, we prove that any Boolean lattice is a PC-lattice and we show that if X is a PC-lattice with condition S, then X is an involutory BCK-algebra if and only if X is a commutative BCK-algebra. Finally, we prove that any PC-lattice with condition (S) is a distributive BCK-algebra.
2018-01-01T00:00:00ZA Useful Four-Valued Extension of the Temporal Logic KtT4Degauquier, Vincenthttp://hdl.handle.net/11089/264092019-03-21T02:17:45Z2018-01-01T00:00:00ZA Useful Four-Valued Extension of the Temporal Logic KtT4
Degauquier, Vincent
The temporal logic KtT4 is the modal logic obtained from the minimal temporal
logic Kt by requiring the accessibility relation to be reflexive (which corresponds to
the axiom T) and transitive (which corresponds to the axiom 4). This article aims,
firstly, at providing both a model-theoretic and a proof-theoretic characterisation
of a four-valued extension of the temporal logic KtT4 and, secondly, at identifying
some of the most useful properties of this extension in the context of partial and
paraconsistent logics.
2018-01-01T00:00:00Z