Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187
نویسندگان
چکیده
Addendum to “Choiceless polynomial time” Ann. Pure Appl. Logic 100 (1999) 141–187 Andreas Blassa ; ∗;1, Yuri Gurevichb Saharon Shelahc;d ; 2 aMathematics Department, University of Michigan, Ann Arbor, MI 48109–1109, USA bMicrosoft Research, One Microsoft Way, Redmond, WA 98052, USA cMathematics Department, Hebrew University, Jerusalem 91904, Israel dMathematics Department, Rutgers University, New Brunswick, NJ 08903, USA
منابع مشابه
Choiceless Polynomial Time
Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a ...
متن کاملChoiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract)
We consider Choiceless Polynomial Time (C̃PT), a language introduced by Blass, Gurevich and Shelah, and show that it can express a query originally constructed by Cai, Fürer and Immerman to separate fixed-point logic with counting (IFP + C) from P. This settles a question posed by Blass et al. The program we present uses sets of unbounded finite rank: we demonstrate that this is necessary by sho...
متن کاملThe strength of choiceless patterns of singular and weakly compact cardinals
We extend the core model induction technique to a choiceless context, and we exploit it to show that each one of the following two hypotheses individually implies that AD, the Axiom of Determinacy, holds in the L(R) of a generic extension of HOD: (a) ZF + every uncountable cardinal is singular, and (b) ZF + every infinite successor cardinal is weakly compact and every uncountable limit cardinal...
متن کاملCompleteness of S4 with respect to the real line: revisited
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (Ann. of Math. (2) 45 (1944) 141). We also prove that the same result holds for the bimodal system S4 + S5 + C, which is a strengthening of a 1999 result of Shehtman (J. Appl. Non-Classical Logics 9 (1999) 369). © 2004 ...
متن کاملRelating the Bounded Arithmetic and Polynomial Time Hierarchies
The bounded arithmetic theory S 2 is nitely axiomatized if and only if the polynomial hierarchy provably collapses. If T i 2 equals S i+1 2 then T i 2 is equal to S 2 and proves that the polynomial time hierarchy collapses to p i+3 , and, in fact, to the Boolean hierarchy over p i+2 and to p i+1 =poly .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 112 شماره
صفحات -
تاریخ انتشار 2001