Logic between Expressivity and Complexity

被引：0

作者：

van Benthem, Johan ^{[1
]}

机构：

[1] Univ Amsterdam, Inst Log Language & Computat, NL-1012 WX Amsterdam, Netherlands

来源：

AUTOMATED REASONING | 2010年 / 6173卷

关键词：

FRAGMENTS;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Automated deduction is not just application or implementation of logical systems. The field of computational logic also poses deep challenges to our understanding of logic itself. I will discuss some key issues. This text is just an appetizer that will be elaborated in the lecture.

引用

页码：122 / 126

页数：5

共 9 条

[1] Modal languages and bounded fragments of predicate logic [J].

Andreka, H ;

Nemeti, I ;

van Benthem, J .

JOURNAL OF PHILOSOPHICAL LOGIC, 1998, 27 (03) :217-274

[2]

Piro R., 2008, Advances in Modal Logic, V7, P273

[3]

ten Cate B, 2007, IEEE S LOG, P280, DOI 10.1109/LICS.2007.29

[4] Guards, Bounds, and Generalized Semantics [J].

Johan van Benthem .

Journal of Logic, Language and Information, 2005, 14 (3) :263-279

[5] Minimal predicates. fixed-points. and definability [J].

Van Benthem, J .

JOURNAL OF SYMBOLIC LOGIC, 2005, 70 (03) :696-712

[6]

van Benthem J., 1997, Exploring logical dynamics

[7] A New Modal Lindstrom Theorem [J].

van Benthem, Johan .

LOGICA UNIVERSALIS, 2007, 1 (01) :125-138

[8]

van Benthem Johan., 2010, Logical Dynamics of Information and Interaction

[9]

VANBENTHEM J, 2010, MODAL LOGICS OPEN MI

← 1 →