Strong computability of slices over the logic Gl

Larisa L.vovna Maksimova; Veta Fedorovna Yun

doi:10.17377/semi.2018.15.005

Strong computability of slices over the logic Gl

Переведенное название: Сильная вычислимость слоев над логикой Gl

Larisa L.vovna Maksimova, Veta Fedorovna Yun

Кафедра алгебры и математической логики ММФ

Результат исследования: Научные публикации в периодических изданиях › статья

1 Цитирования (Scopus)

Аннотация

В [2] введена классификация расширений минимальной логики J Йохансона с помощью слоев, доказана разрешимость классификации. Мы рассмотрим расширения логики Gl = J + (A V -А). Логика Gl и ее расширения изучались в [8, 9]. В [6] установлено, что логика Gl сильно узнаваема над J, а семейство расширений логики Gl сильно разрешимо над J. В этой статье мы докажем сильную разрешимость классификации над логикой Gl: для каждого конечного множества Rul схем аксиом и правил вывода можно эффективно вычислить номер слоя исчисления, полученного из Gl добавлением Rul в качестве новых аксиом и правил

Переведенное название	Сильная вычислимость слоев над логикой Gl
Язык оригинала	английский
Страницы (с-по)	35-47
Число страниц	13
Журнал	Siberian Electronic Mathematical Reports
Том	15
DOI	https://doi.org/10.17377/semi.2018.15.005
Состояние	Опубликовано - 1 янв 2018

Ключевые слова

Decidability
Kripke frame
Recognizable logic
Slices
The minimal logic

ГРНТИ

27.03 Математическая логика и основания математики

Доступ к документу

10.17377/semi.2018.15.005

Fingerprint Подробные сведения о темах исследования «Сильная вычислимость слоев над логикой Gl». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

Maksimova, L. L. V., & Yun, V. F. (2018). Strong computability of slices over the logic Gl. Siberian Electronic Mathematical Reports, 15, 35-47. https://doi.org/10.17377/semi.2018.15.005

@article{101fe05b198b41ae91e5eddbaeabfab3,

title = "Strong computability of slices over the logic Gl",

abstract = "In [2] the classification of extensions of the minimal logic J using slices was introduced and decidability of the classification was proved. We will consider extensions of the logic Gl = J + (A V ¬A). The logic Gl and its extensions have been studied in [8, 9]. In [6], it is established that the logic Gl is strongly recognizable over J, and the family of extensions of the logic Gl is strongly decidable over J. In this paper we prove strong decidability of the classification over Gl: for every finite set Rul of axiom schemes and rules of inference, it is possible to efficiently calculate the slice number of the calculus obtained by adding Rul as new axioms and rules to Gl.",

keywords = "Decidability, Kripke frame, Recognizable logic, Slices, The minimal logic, The minimal logic, slices, Kripke frame, decidability, recognizable logic",

author = "Maksimova, {Larisa L.vovna} and Yun, {Veta Fedorovna}",

year = "2018",

month = jan,

day = "1",

doi = "10.17377/semi.2018.15.005",

language = "English",

volume = "15",

pages = "35--47",

journal = "Siberian Electronic Mathematical Reports",

issn = "1813-3304",

publisher = "Sobolev Institute of Mathematics",

}

TY - JOUR

T1 - Strong computability of slices over the logic Gl

AU - Maksimova, Larisa L.vovna

AU - Yun, Veta Fedorovna

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In [2] the classification of extensions of the minimal logic J using slices was introduced and decidability of the classification was proved. We will consider extensions of the logic Gl = J + (A V ¬A). The logic Gl and its extensions have been studied in [8, 9]. In [6], it is established that the logic Gl is strongly recognizable over J, and the family of extensions of the logic Gl is strongly decidable over J. In this paper we prove strong decidability of the classification over Gl: for every finite set Rul of axiom schemes and rules of inference, it is possible to efficiently calculate the slice number of the calculus obtained by adding Rul as new axioms and rules to Gl.

AB - In [2] the classification of extensions of the minimal logic J using slices was introduced and decidability of the classification was proved. We will consider extensions of the logic Gl = J + (A V ¬A). The logic Gl and its extensions have been studied in [8, 9]. In [6], it is established that the logic Gl is strongly recognizable over J, and the family of extensions of the logic Gl is strongly decidable over J. In this paper we prove strong decidability of the classification over Gl: for every finite set Rul of axiom schemes and rules of inference, it is possible to efficiently calculate the slice number of the calculus obtained by adding Rul as new axioms and rules to Gl.

KW - Decidability

KW - Kripke frame

KW - Recognizable logic

KW - Slices

KW - The minimal logic

KW - slices

KW - Kripke frame

KW - decidability

KW - recognizable logic

UR - http://www.scopus.com/inward/record.url?scp=85074902291&partnerID=8YFLogxK

UR - https://www.elibrary.ru/item.asp?id=36998686

U2 - 10.17377/semi.2018.15.005

DO - 10.17377/semi.2018.15.005

M3 - Article

AN - SCOPUS:85074902291

VL - 15

SP - 35

EP - 47

JO - Siberian Electronic Mathematical Reports

JF - Siberian Electronic Mathematical Reports

SN - 1813-3304

ER -