The relativization of K2

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Syntax of Appositive Relativization

Appositive relative clauses differ in some essential respects from restrictives. I argue that appositive relatives and appositions can be put together as a third class of coordination denoting specification. Thus, an appositive is a specifying conjunct to the visible antecedent. It is a semi-free relative with a pronominal head that is normally empty. Therefore, its internal syntax is equivalen...

متن کامل

The Undecidability of Iterated Modal Relativization

In dynamic epistemic logic and other elds, it is natural to consider relativization as an operator taking sentences to sentences. When using the ideas and methods of dynamic logic, one would like to iterate operators. This leads to iterated relativization. We are also concerned with the transitive closure operation, due to its connection to common knowledge. We show that three fragments of the ...

متن کامل

The Role of Relativization in Complexity Theory

Several recent nonrelativizing results in the area of interactive proofs have caused many people to review the importance of relativization. In this paper we take a look at how complexity theorists use and misuse oracle results. We pay special attention to the new interactive proof systems and program checking results and try to understand why they do not relativize. We give some new results th...

متن کامل

Relativization: a Revisionistic Retrospective

For almost two decades, contradictory relativization has been a central theme in complexity theory. This concept was first introduced by Baker, Gill and Solovay [BGS75] in their ground breaking paper where they exhibited oracles A and B such that P = NP and P 6= NP. This result was startling because almost all results in recursion theory remain true in the presence of oracles and most technique...

متن کامل

Randomness, relativization and Turing degrees

We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin-L?f random relative to 0_1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) > |x| ? c. The 'only if direction was obtained independently by Joseph Miller. This cha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1978

ISSN: 0021-8693

DOI: 10.1016/0021-8693(78)90024-8