Announcements Last Post
Announcement : Programming Students at UNISA School of Computing 06/19/2019 02:01PM
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
avatar 4(e)
May 28, 2011 11:55PM
1. assumption-box-1... p ....
2. ... assumption-box-2.... box ~p (as per hint)
3. ... ~p ........... T, 2.
4. ... "bottom" ............ ~e 1,3. .... end of assumption-box-2
5. ~ box ~p ..... ~i 2-4
6. box ~ box ~p ...... 5 , 5.
7. box diamond p ......... Def. diamond. ..... end of assumtion-box-1
8. p -> box diamond p .................... ->i 1-7

How do we introduce the "definition of diamond" construct? For now this looks an adequate way to justify it, but maybe there's some special notation in the book. Anyone know?
Re: 4(e)
May 30, 2011 10:38AM
I got pretty much the same answer except I redefined the question, without the box and I stated that diamond is equivalent to ~box~ and I left the end of the answer as is simply because all statements were done b4 the answer was attempted.
avatar Re: 4(e)
May 30, 2011 12:21PM
Yes, that sounds good. Give the def for diamond before doing anything, and then work purely in terms of box. No real need to give the answer in terms of diamond at the end, then... but if diamond is what's specified, it's probably safer and "more complete" to do so? It's no extra work, really.
Sorry, only registered users may post in this forum.

Click here to login