Solutions to selected exercises of Chapters 17 and 18 Bas Luttik

نویسنده

  • Bas Luttik
چکیده

The proofs below are given in textual form and contain the minimum amount of detail both with respect to the logic and reasoning involved, and with respect to the properties and definitions pertaining to sets, relations and mappings. Note that most applications of logical reasoning steps (i.e., the introduction and elimination rules discussed in Parts I and II of the book) are left implicit, but you should nevertheless be able to recognise where and how they are applied. For your convenience, there is also an appendix at the end of this document with very detailed logical derivations, following the methods of Parts I and II to the letter and being explicit about which rule is applied when. We encourage you to compare the proofs in textual form and the logical derivations, to make sure that you understand every step. At examinations you may give proofs about properties of sets, relations an mappings either in textual form, or as logical derivations.

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

ثبت نام

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

منابع مشابه

Solutions to selected exercises about induction

Then, for all x ∈ R, g(x) = x−1 < x = i(x) and i(x) = x < x+1 = h(x). Hence g < i < h. (b) To prove that 〈Φ, <〉 is an irreflexive ordering, it suffices to prove that < on Φ is irreflexive and transitive. (We do not need to prove that < on Φ is strictly antisymmetric because, according to Exercise 20.2, this already follows from irreflexivity and transitivity.) To prove that < on Φ is irreflexiv...

متن کامل

T C C

This is an extended version of an essay with the same title that I wrote for the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, held in Bertinoro, Italy in the first week of August 2005.

متن کامل

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of 0, action prefix, choice, and the recursion construct μX. .

متن کامل

Reflections on a Geometry of Processes

In this note we discuss some issues concerning a geometric approach to process algebra. We mainly raise questions and are not yet able to present significant answers.

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2011