A note on globally admissible inference rules for modal and superintuitionistic logics

2.50
Hdl Handle:
http://hdl.handle.net/2173/96170
Title:
A note on globally admissible inference rules for modal and superintuitionistic logics
Authors:
Rimatski, V. V.; Rybakov, Vladimir V.
Citation:
Bulletin of the section of logic, 2005, vol. 34, no. 2, pp. 93-100
Publisher:
Uniwersytet Lodzki, Wydzial Logiki
Issue Date:
2005
URI:
http://hdl.handle.net/2173/96170
Additional Links:
http://www.filozof.uni.lodz.pl/bulletin
Abstract:
In this short note we consider globally admissible inference rules. A rule r is globally admissible in a logic L if r is admissible in all logics with the finite model property which extend L. Here we prove a reduction theorem: we show that, for any modal logic L extending K4, a rule r is globally admissible in L iff r is admissible in all tabular logics extending L. The similar result holds for superintuitionistic logics.
Type:
Article
Language:
en
Description:
Full-text of this article is not available in this e-prints service. This article was originally published following peer-review in Bulletin of the Section of Logic, published by and copyright Uniwersytet Lodzki, Wydzial Logiki.
ISSN:
0138-0680

Full metadata record

DC FieldValue Language
dc.contributor.authorRimatski, V. V.en
dc.contributor.authorRybakov, Vladimir V.en
dc.date.accessioned2010-04-09T13:41:29Z-
dc.date.available2010-04-09T13:41:29Z-
dc.date.issued2005-
dc.identifier.citationBulletin of the section of logic, 2005, vol. 34, no. 2, pp. 93-100en
dc.identifier.issn0138-0680-
dc.identifier.urihttp://hdl.handle.net/2173/96170-
dc.descriptionFull-text of this article is not available in this e-prints service. This article was originally published following peer-review in Bulletin of the Section of Logic, published by and copyright Uniwersytet Lodzki, Wydzial Logiki.en
dc.description.abstractIn this short note we consider globally admissible inference rules. A rule r is globally admissible in a logic L if r is admissible in all logics with the finite model property which extend L. Here we prove a reduction theorem: we show that, for any modal logic L extending K4, a rule r is globally admissible in L iff r is admissible in all tabular logics extending L. The similar result holds for superintuitionistic logics.en
dc.language.isoenen
dc.publisherUniwersytet Lodzki, Wydzial Logikien
dc.relation.urlhttp://www.filozof.uni.lodz.pl/bulletinen
dc.titleA note on globally admissible inference rules for modal and superintuitionistic logicsen
dc.typeArticleen
All Items in e-space are protected by copyright, with all rights reserved, unless otherwise indicated.