DECIDABILITY OF THEORIES IN LOGICS WITH GENERALIZED QUANTIFIERS

被引：0
|
作者：
HERRE, H
WOLTER, H
机构：
来源：
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK | 1975年 / 21卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：229 / 246
页数：18
相关论文
共 50 条
  • [41] Decidability and expressive power of real time logics
    Rabinovich, Alexander
    [J]. FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2006, 4202 : 32 - 32
  • [42] Decidability Preservation and Complexity Bounds for Combined Logics
    Caleiro, Carlos
    Marcelino, Sergio
    [J]. MATHEMATICS, 2022, 10 (19)
  • [43] Japanese floating numeral quantifiers as generalized quantifiers
    Yokota, Kenji
    [J]. LANGUAGE SCIENCES, 2014, 45 : 123 - 134
  • [44] Quantifiers elimination for commutative theories
    Palyutin, EA
    [J]. DOKLADY AKADEMII NAUK, 1998, 363 (03) : 301 - 303
  • [45] DECIDABILITY AND OPERATIONS BETWEEN THEORIES
    DULAC, MH
    [J]. COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1971, 273 (23): : 1113 - &
  • [46] Decidability of Quasi-Dense Modal Logics
    Ostropolski-Nalewaja, Piotr
    Lyon, Tim S.
    [J]. PROCEEDINGS OF THE 39TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS 2024, 2024,
  • [47] GENERALIZED QUANTIFIERS, AND BEYOND
    Ben-Yami, Hanoch
    [J]. LOGIQUE ET ANALYSE, 2009, (208) : 309 - 326
  • [48] On Decidability of Regular Languages Theories
    Dudakov, Sergey
    Karlov, Boris
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 119 - 130
  • [49] On Decidability of Theories of Regular Languages
    Dudakov, Sergey
    Karlov, Boris
    [J]. THEORY OF COMPUTING SYSTEMS, 2021, 65 (03) : 462 - 478
  • [50] Elimination of quantifiers and undecidability in spatial logics for concurrency
    Caires, Luis
    Lozes, Etienne
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 358 (2-3) : 293 - 314
12345