%PDF-1.4 % 4 0 obj << /S /GoTo /D (section.1) >> endobj 7 0 obj (Introduction) endobj 8 0 obj << /S /GoTo /D (section.2) >> endobj 11 0 obj (Preliminaries and Notation) endobj 12 0 obj << /S /GoTo /D (section.3) >> endobj 15 0 obj (Hypersequent Rules with Restrictions) endobj 16 0 obj << /S /GoTo /D (section.4) >> endobj 19 0 obj (Cut Elimination and Applications) endobj 20 0 obj << /S /GoTo /D (subsection.4.1) >> endobj 23 0 obj (Applications: Decision Procedures and Complexity Bounds) endobj 24 0 obj << /S /GoTo /D (section.5) >> endobj 27 0 obj (Axioms and Rules) endobj 28 0 obj << /S /GoTo /D (subsection.5.1) >> endobj 31 0 obj (Interpretations) endobj 32 0 obj << /S /GoTo /D (subsection.5.2) >> endobj 35 0 obj (From Rules to Axioms) endobj 36 0 obj << /S /GoTo /D (subsection.5.3) >> endobj 39 0 obj (From Axioms to Rules) endobj 40 0 obj << /S /GoTo /D (subsection.5.4) >> endobj 43 0 obj (Non-normal restrictions) endobj 44 0 obj << /S /GoTo /D (subsection.5.5) >> endobj 47 0 obj (Applications: Limitative Results) endobj 48 0 obj << /S /GoTo /D (section.6) >> endobj 51 0 obj (Case Studies) endobj 52 0 obj << /S /GoTo /D (subsection.6.1) >> endobj 55 0 obj (Logics for Simple Frame Properties) endobj 56 0 obj << /S /GoTo /D (subsection.6.2) >> endobj 59 0 obj (Modal Logic S5) endobj 60 0 obj << /S /GoTo /D (subsection.6.3) >> endobj 63 0 obj (Convergent and connected normal modal logics) endobj 64 0 obj << /S /GoTo /D (subsection.6.4) >> endobj 67 0 obj (Simply dependent bimodal logics) endobj 68 0 obj << /S /GoTo /D (section.7) >> endobj 71 0 obj (Conclusion) endobj 72 0 obj << /S /GoTo /D [73 0 R /Fit ] >> endobj 78 0 obj << /Length 3069 /Filter /FlateDecode >> stream xڭYK۸ϯБqHSg[q09寧_HTr"h4`گn}usF08UUa29vOۧz2ϴs0z0Tf=~z|0]ڲ7;Y{1imP|5mS6_^EEڄ_Dٻfo/R0+F~ {gG $gAHTɉcYu~ cyOĖ{Iz?!Vp)8MXпkOs\ylH&!1|[ހ-i9BQ{ >AEǞ)CHKE()rq~CnwM8͟7!Y Wi'Z%[Iͧ/jc螨Wy\iDAZ}'hLJ|[XXu /0viwmݽMtFbçٷx4`kB6O0pLq<02aLܯ7Yȭs;xE!~/پPߐMf$mh^Hr8zNz{i{qBc['nEF Bm+ado7) rԲ&jOW8 TLh띿ġIMj 膓@4F-]V:GQ\1`8;k1nKQtG[SX.3魭 ;I Ȝd`TAyz4R} m[W]