Hesperus is Phosphorus, Indeed

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

What, Indeed, Is Intransitive Noninterference?

This paper argues that Haigh and Young’s definition of noninterference for intransitive security policies admits information flows that are not in accordance with the intuitions it seeks to formalise. Several alternative definitions are discussed, which are shown to be equivalent to the classical definition of noninterference with respect to transitive policies. Rushby’s unwinding conditions fo...

متن کامل

Apery's Double Sum is Plain Sailing Indeed

We demonstrate that also the second sum involved in Apéry’s proof of the irrationality of ζ(3) becomes trivial by symbolic summation. In his beautiful survey [4], van der Poorten explained that Apéry’s proof [1] of the irrationality of ζ(3) relies on the following fact: If a(n) = n

متن کامل

Branching Bisimilarity is an Equivalence Indeed!

This note presents a detailed proof of a result in the theory of concurrency semantics that is already considered folklore, namely that branching bisimilarity is an equivalence relation. The \simple proof," which in the literature is always assumed to exist, is shown to be incorrect. The proof in this note is based on the notion of a semi-branching bisimulation taken from [10]. Branching bisimi...

متن کامل

(Leftmost-Outermost) Beta Reduction is Invariant, Indeed

Slot and van Emde Boas’ weak invariance thesis states that reasonable machines can simulate each other within a polynomial overhead in time. Is λ-calculus a reasonable machine? Is there a way to measure the computational complexity of a λ-term? This paper presents the first complete positive answer to this long-standing problem. Moreover, our answer is completely machine-independent and based o...

متن کامل

ATL Satisfiability is Indeed EXPTIME-complete

The alternating-time temporal logic (ATL) of Alur, Henzinger and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems and game-like multi-agent systems. In this article, we investigate the computational complexity of the satisfiability problem for ATL. For the case where the set of agents is fixed in advance, this problem was settled a...

متن کامل

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


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

ژورنال

عنوان ژورنال: Axiomathes

سال: 2009

ISSN: 1572-8390,1572-8390

DOI: 10.1007/s10516-009-9068-1