Simulation, theory, and cut-elimination (Philosophy of computer science)

被引：1

作者：

White, GG ^{[1
]}

机构：

[1] Queen Mary Univ London, Dept Comp Sci, London E1 4NS, England

来源：

MONIST | 1999年 / 82卷 / 01期

关键词：

D O I：

10.5840/monist199982111

中图分类号：

B [哲学、宗教];

学科分类号：

01 ; 0101 ;

摘要：

引用

收藏

页码：165 / 184

页数：20

相关论文

共 26 条

[1] A DEDUCTIVE SOLUTION FOR PLAN GENERATION
BIBEL, W
[J]. NEW GENERATION COMPUTING, 1986, 4 (02) : 115 - 132
[2] A SURVEY OF COMPLEXITY RESULTS FOR NONMONOTONIC LOGICS
CADOLI, M
SCHAERF, M
[J]. JOURNAL OF LOGIC PROGRAMMING, 1993, 17 (2-4): : 127 - 160
[3] THE COMPLEXITY OF MODEL CHECKING FOR CIRCUMSCRIPTIVE FORMULAS
CADOLI, M
[J]. INFORMATION PROCESSING LETTERS, 1992, 44 (03) : 113 - 118
[4] THE COMPLEXITY OF PROPOSITIONAL CLOSED WORLD REASONING AND CIRCUMSCRIPTION
CADOLI, M
LENZERINI, M
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 48 (02) : 255 - 310
[5] Davies M, 1994, OBJECTIVITY SIMULATI, P99
[6] Girard J.-Y., 1992, FIXPOINT THEOREM LIN
[7] LINEAR LOGIC
GIRARD, JY
[J]. THEORETICAL COMPUTER SCIENCE, 1987, 50 (01) : 1 - 102
[8] Simulation and cognitive penetrability
Heal, J
[J]. MIND & LANGUAGE, 1996, 11 (01) : 44 - 67
[9] HEAL J, 1994, OBJECTIVITY SIMULATI, P129
[10] HOLLDOBLER S, 1990, NEW GENERAT COMPUT, V8, P225, DOI 10.1007/BF03037518