COMPLETENESS THEOREM FOR INFINITARY LOGIC

被引：0

|

作者：

MANSFIELD, R

机构：

来源：

JOURNAL OF SYMBOLIC LOGIC | 1971年 / 36卷 / 04期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

下载

收藏

页码：709 / +

页数：1

相关论文

共 50 条

[41] WEAK COMPLETENESS OF LARGE INFINITARY LANGUAGES
HEIDEMA, J
LABUSCHAGNE, WA
JOURNAL OF SYMBOLIC LOGIC, 1981, 46 (02) : 436 - 436
[42] INFINITARY MODAL LOGIC
CHAPIN, EW
JOURNAL OF SYMBOLIC LOGIC, 1974, 39 (02) : 397 - 397
[43] COMPUTING WITH INFINITARY LOGIC
ABITEBOUL, S
VARDI, M
VIANU, V
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 646 : 113 - 123
[44] COMPLETE INFINITARY LOGIC
SLONNEGER, K
JOURNAL OF SYMBOLIC LOGIC, 1976, 41 (04) : 730 - 746
[45] COMPUTING WITH INFINITARY LOGIC
ABITEBOUL, S
VARDI, MY
VIANU, V
THEORETICAL COMPUTER SCIENCE, 1995, 149 (01) : 101 - 128
[46] Supervenience and infinitary logic
Glanzberg, M
NOUS, 2001, 35 (03): : 419 - 439
[47] COINDUCTIVE FOUNDATIONS OF INFINITARY REWRITING AND INFINITARY EQUATIONAL LOGIC
Endrullis, Jorg
Hansen, Helle Hvid
Hendriks, Dimitri
Polonsky, Andrew
Silva, Alexandra
LOGICAL METHODS IN COMPUTER SCIENCE, 2018, 14 (01)
[48] A COMPLETENESS THEOREM OF FIRST-ORDER TEMPORAL LOGIC WITH EQUALITY
唐同诰
Science China Mathematics, 1985, (05) : 532 - 540
[49] A simplified proof of arithmetical completeness theorem for provability logic GLP
Beklemishev, L. D.
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2011, 274 (01) : 25 - 33
[50] Weak Completeness Theorem of Logic System MTLQ with Linguistic Quantifiers
Zhang, Xiaohong
Zeng, Xu
2011 AASRI CONFERENCE ON APPLIED INFORMATION TECHNOLOGY (AASRI-AIT 2011), VOL 1, 2011, : 283 - 286

← 1 2 3 4 5 →