Koepke Machines and Satisfiability for Infinitary Propositional Languages

被引：4
|
作者：
Carl, Merlin [1 ,2 ]
Loewe, Benedikt [3 ,4 ,5 ,6 ]
Rin, Benjamin G. [7 ]
机构：
[1] Univ Konstanz, Fachbereich Math & Stat, D-78457 Constance, Germany
[2] Univ Passau, Fak Informat & Math, Innstr 33, D-94032 Passau, Germany
[3] Univ Amsterdam, Inst Log Language & Computat, Postbus 94242, NL-1090 GE Amsterdam, Netherlands
[4] Univ Hamburg, Fachbereich Math, Bundesstr 55, D-20146 Hamburg, Germany
[5] Univ Cambridge, Churchill Coll, Christs Coll, Wilberforce Rd, Cambridge CB3 0WA, England
[6] Univ Cambridge, Fac Math, Wilberforce Rd, Cambridge CB3 0WA, England
[7] Univ Utrecht, Dept Filosofie Religiewetenschap, Janskerkhof 13, NL-3512 BL Utrecht, Netherlands
来源：
UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017 | 2017年 / 10307卷
关键词：
TIME TURING-MACHINES; NOT-EQUAL NP;
D O I：
10.1007/978-3-319-58741-7_19
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider complexity theory for Koepke machines, also known as Ordinal Turing Machines (OTMs), and define infinitary complexity classes infinity-P and infinity-NP and the OTM analogue of the satisfiability problem, denoted by infinity-SAT. We show that infinity-SAT is in infinity-NP and infinity-NP-hard (i.e., the problem is infinity-NP-complete), but not OTM decidable.
引用
收藏
页码：187 / 197
页数：11
相关论文
共 50 条
12345