[OT] Modal logic
Pietro Braione
braione@elet.polimi.it
Mon Jun 18 11:02:01 2001
This is a multi-part message in MIME format.
------=_NextPart_000_002E_01C0F800.1F409AF0
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
For all those interested in modal logic at www.mlbook.org you can freely =
download the last preview of the book "Modal Logic", more than 500 pages =
on the topic. A relational algebra based approach is used to present in =
a unified framework classic, temporal, PDL and arrow logic. Both =
correspondance theory and duality are deeply treated, and a 100 page =
chapter is dedicated to computational issues, comprising time and space =
complexity for formula evaluation. Decisely a must.
Pietro
------=_NextPart_000_002E_01C0F800.1F409AF0
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Diso-8859-1" =
http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.3315.2870" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial size=3D2>For all those interested in modal logic =
at <A=20
href=3D"http://www.mlbook.org">www.mlbook.org</A> you can freely =
download the last=20
preview of the book "Modal Logic", more than 500 pages on the =
topic. A=20
relational algebra based approach is used to present in a unified =
framework=20
classic, temporal, PDL and arrow logic. Both correspondance theory and =
duality=20
are deeply treated, and a 100 page chapter is dedicated to computational =
issues,=20
comprising time and space complexity for formula evaluation. Decisely a=20
must.</FONT></DIV>
<DIV> </DIV>
<DIV><FONT face=3DArial size=3D2>Pietro</FONT></DIV></BODY></HTML>
------=_NextPart_000_002E_01C0F800.1F409AF0--