Mathematics - Proving a link between logic and origami

被引：1
|
作者：
Cipra, B
机构：
来源：
SCIENCE | 1998年 / 279卷 / 5352期
关键词：
D O I：
10.1126/science.279.5352.804
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
引用
收藏
页码：804 / 805
页数：2
相关论文
共 50 条
  • [31] Mathematics and Logic
    Pasch, M.
    [J]. ARCHIV FUR DIE GESAMTE PSYCHOLOGIE, 1919, 38 (3-4): : 269 - 315
  • [32] Mathematics and Logic
    Reich, Ulrich
    [J]. ANNALS OF SCIENCE, 2014, 71 (02) : 273 - 275
  • [33] Mathematics and Logic
    Kidwell, Peggy Aldrich
    [J]. ANNALS OF SCIENCE, 2014, 71 (04) : 595 - 597
  • [34] METHODOLOGY FOR PROVING THE TERMINATION OF LOGIC PROGRAMS
    WANG, B
    SHYAMASUNDAR, RK
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 480 : 214 - 227
  • [35] Proving quantified literals in Defeasible Logic
    Billington, D
    [J]. INFORMATION SCIENCES, 1999, 116 (01) : 55 - 81
  • [36] THEOREM-PROVING FOR INTENSIONAL LOGIC
    RAMSAY, A
    [J]. JOURNAL OF AUTOMATED REASONING, 1995, 14 (02) : 237 - 255
  • [37] Proving differential privacy in Hoare logic
    Barthe, Gilles
    Gaboardi, Marco
    Arias, Emilio Jesus Gallego
    Hsu, Justin
    Kunz, Cesar
    Strub, Pierre-Yves
    [J]. 2014 IEEE 27TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF), 2014, : 411 - 424
  • [38] Proving completeness of logic programs with the cut
    Drabent, Wodzimierz
    [J]. FORMAL ASPECTS OF COMPUTING, 2017, 29 (01) : 155 - 172
  • [39] A METHODOLOGY FOR PROVING TERMINATION OF LOGIC PROGRAMS
    WANG, B
    SHYAMASUNDAR, RK
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1994, 21 (01): : 1 - 30
  • [40] Proving failure in functional logic programs
    López-Fraguas, FJ
    Sánchez-Hernández, J
    [J]. COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 179 - 193
12345