Please use this identifier to cite or link to this item:
Title: Admissible equivalence systems
Author: Babenyshev, Sergey
Martins, Manuel A.
Keywords: Abstract algebraic logic
Equivalence systems
Admissible rules
Leibniz operator
Behavioral theorems
Issue Date: 2010
Publisher: Department of Logic, University of Lodz
Abstract: Whenever a logic is the set of theorems of some deductive system, where the latter has an equivalence system, the behavioral theorems of the logic can be determined by means of that equivalence system. In general, this original equivalence system may be too restrictive, because it su ces to check behavioral theorems by means of any admissible equivalence system (that is an equivalence system of the small- est deductive system associated with the given logic). In this paper, we present a range of examples, which show that: 1) there is an admissible equivalence system which is not an equivalence system for the initial deductive system, 2) there is a non- nitely equivalential deductive system with a nite admissible equivalence system, and 3) there is a deductive system with an admissible equivalence sys- tems, such that this deductive system is not even protoalgebraic itself. We use methods and results from algebraic and modal logic.
Peer review: yes
ISSN: 0138-0680
Publisher Version:
Appears in Collections:DMat - Artigos

Files in This Item:
File Description SizeFormat 
aes.pdfPreprint356.28 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.