On linear Brouwerian logics

被引：1
|
作者：
Kostrzycka, Zofia [1 ]
机构：
[1] Opole Univ Technol, Dept Math & IT Applicat, PL-45036 Opole, Poland
来源：
MATHEMATICAL LOGIC QUARTERLY | 2014年 / 60卷 / 4-5期
关键词：
EXTENSIONS; NEXT(KTB); S4.3;
D O I：
10.1002/malq.201200075
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We define a special family of Brouwerian logics determined by linearly ordered frames. Then we prove that all logics of this family have the finite model property and are Kripke complete. (C) 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
引用
收藏
页码：304 / 313
页数：10
相关论文
共 50 条
  • [1] REDUCTION LAWS IN BROUWERIAN MODAL-LOGICS
    LUCAS, BJ
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (04) : 1096 - 1097
  • [2] Brouwerian infinity
    Posy, Carl
    [J]. ONE HUNDRED YEARS OF INTUITIONISM ( 1907- 2007 ): THE CERISY CONFERENCE, 2008, : 21 - 36
  • [3] BROUWERIAN GEOMETRY
    NORDHAUS, EA
    LAPIDUS, L
    [J]. CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1954, 6 (02): : 217 - 229
  • [4] A framework for linear authorization logics
    Nigam, Vivek
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 536 : 21 - 41
  • [5] On the Complexity of Linear Authorization Logics
    Nigam, Vivek
    [J]. 2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 511 - 520
  • [6] On the products of linear modal logics
    Reynolds, M
    Zakharyaschev, M
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2001, 11 (06) : 909 - 931
  • [7] Intuitionistic Linear Temporal Logics
    Balbiani, Philippe
    Boudou, Joseph
    Dieguez, Martin
    Fernandez-Duque, David
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2020, 21 (02)
  • [8] BROUWERIAN INTUITIONISM
    DETLEFSEN, M
    [J]. MIND, 1990, 99 (396) : 501 - 534
  • [9] WEIHRAUCH GOES BROUWERIAN
    Brattka, Vasco
    Gherardi, Guido
    [J]. JOURNAL OF SYMBOLIC LOGIC, 2020, 85 (04) : 1614 - 1653
  • [10] BROUWERIAN GENERALISED LATTICES
    Kishore, Parimi Radhakrishna
    Mudaso, Demelash Kumsa
    [J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2022, 29 (02): : 205 - 222
12345