A comparison of weak completeness notions

被引：8
|
作者：
AmbosSpies, K [1 ]
Mayordomo, E [1 ]
Zheng, XZ [1 ]
机构：
[1] UNIV HEIDELBERG,MATH INST,D-69120 HEIDELBERG,GERMANY
来源：
ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS | 1996年
关键词：
D O I：
10.1109/CCC.1996.507679
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：171 / 178
页数：8
相关论文
共 50 条
  • [21] Weak Dependence Notions and Their Mutual Relationships
    Navarro, Jorge
    Pellerey, Franco
    Sordo, Miguel A.
    [J]. MATHEMATICS, 2021, 9 (01) : 1 - 27
  • [22] WEAK NOTIONS OF JACOBIAN DETERMINANT AND RELAXATION
    De Philippis, Guido
    [J]. ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS, 2012, 18 (01) : 181 - 207
  • [23] Completeness and weak completeness under polynomial-size circuits
    Juedes, DW
    Lutz, JH
    [J]. INFORMATION AND COMPUTATION, 1996, 125 (01) : 13 - 31
  • [24] Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages
    Carette, Titouan
    Lemonnier, Louis
    Zamdzhiev, Vladimir
    [J]. 2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS, 2023,
  • [25] Separating NP-completeness notions under strong hypotheses
    AmbosSpies, K
    Bentzien, L
    [J]. TWELFTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1997, : 121 - 127
  • [26] Numeral completeness of weak theories of arithmetic
    Kahle, Reinhard
    Oitavem, Isabel
    Santos, Paulo Guilherme
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2023,
  • [27] Continuity, completeness and the definition of weak preferences
    Karni, Edi
    [J]. MATHEMATICAL SOCIAL SCIENCES, 2011, 62 (02) : 123 - 125
  • [28] WEAK AND STRONG COMPLETENESS IN SENTENTIAL LOGICS
    CORCORAN, J
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1972, 37 (04) : 780 - 780
  • [29] A COMPLETENESS THEOREM FOR WEAK EQUATIONAL LOGIC
    RUDAK, L
    [J]. ALGEBRA UNIVERSALIS, 1983, 16 (03) : 331 - 337
  • [30] Weak Completeness of Coalgebraic Dynamic Logics
    Hansen, Helle Hvid
    Kupke, Clemens
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2015, (191): : 90 - 104
12345