UNDECIDABILITY OF SOME INTUTITIONISTIC THEORIES OF EQUALITY AND ORDER

被引:0
|
作者
SMORYNSKI, C
机构
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:587 / +
页数:1
相关论文
共 50 条
  • [21] The undecidability of proof search when equality is a logical connective
    Miller, Dale
    Viel, Alexandre
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2022, 90 (05) : 523 - 535
  • [22] The undecidability of proof search when equality is a logical connective
    Dale Miller
    Alexandre Viel
    Annals of Mathematics and Artificial Intelligence, 2022, 90 : 523 - 535
  • [23] Elementary theories and hereditary undecidability for semilattices of numberings
    Nikolay Bazhenov
    Manat Mustafa
    Mars Yamaleev
    Archive for Mathematical Logic, 2019, 58 : 485 - 500
  • [24] Elementary theories and hereditary undecidability for semilattices of numberings
    Bazhenov, Nikolay
    Mustafa, Manat
    Yamaleev, Mars
    ARCHIVE FOR MATHEMATICAL LOGIC, 2019, 58 (3-4) : 485 - 500
  • [26] THE UNDECIDABILITY OF THE UNIFICATION AND MATCHING PROBLEM FOR CANONICAL THEORIES
    HEILBRUNNER, S
    HOLLDOBLER, S
    ACTA INFORMATICA, 1987, 24 (02) : 157 - 171
  • [27] On the undecidability of second-order unification
    Levy, J
    Veanes, M
    INFORMATION AND COMPUTATION, 2000, 159 (1-2) : 125 - 150
  • [28] Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories
    Kao, Ying-Fang
    Ragupathy, V.
    Velupillai, K. Vela
    Zambelli, Stefano
    COMPLEXITY, 2012, 18 (01) : 51 - 55
  • [29] DECIDABILITY, UNDECIDABILITY, AND GODEL'S INCOMPLETENESS IN RELATIVITY THEORIES
    Andreka, Hajnal
    Madarasz, Judit
    Nemeti, Istvan
    PARALLEL PROCESSING LETTERS, 2012, 22 (03)
  • [30] UNDECIDABILITY OF SOME DOMINO CONNECTABILITY PROBLEMS
    EBBINGHAUS, HD
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1982, 28 (04): : 331 - 336