WPCA 2EBS Z Couriermanitch3|x manHelveticaX@KX@Laurentius_PostScript_(HP_LJ_III.PS)LAURENTI.PRSx  @Uhhhhw7X@3'3'Standard6&&ein wittgensteiniana wittgensteiniano6&Standard d Printer&$S #x  @UX@# dddd X` hp x (#%'0*,.8135@8:>xxxxxP|x!T"x}xExPPPxxxxPxkxofxkkPPPPk]kxkPCkkxkxxxkk]xCCkkkkPPxxxxxxx]]]]]]]xxxxxxxxxxxxxxxxxxxxCCCCCCCCCCCCkkkkkkkkkkkkkkkkkkkPPxkP"m^FSw޵FSSaFSFFSSõFеçõ짧SFSFz8ozzzaFaSFSS*SSSSSSSSSSF޵FFFFFFFFÙÙÙÙÙÙÙÙÙÙÙÙFFFFFFFFFFFFFÙÙaaaSSSç}}}FaSÙKXFS][<}}SSF}jkkjxxxxxx[C]C]C]CsC`C]Cxxjjk[][]`RxjkjCk]PxxxPxxPPPWxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNxxxPxffxxxxxxTxxxxTPPx>>xxxxxPxT"xxExPPPxxxxPxkxsfxxxPPPPk]kkk]Ckkxkxxxkk]kCCkkkkPPxxxxxxx]]]]]]]kkkkkkkkkkkkkkkkkkkkCCCCCCCCCCCCkkkkkkkkkkkkkkkkkkkP]xkP2oW [ ee 6j"m^11>aau'::Df1:11aaaaaaaaaa11fffauu~~uk~1Xua~u~uk~uuuk111Ra'aaXaa1aa''X'aaaa:X1aX~XXX:.:f:1::::::::::::k1uauauauaua~Xuauauaua11111111~aaaaa~a~a~a~auXua~akauXuauaua~X~X~X~X~auauauauaaaaaaa~a~a11111'11XuXa'a'a'a'a'~a~a~a~aaa~:~:~:uXuXuXuXk1k1k1~a~a~a~a~a~a~uXkXkXkX~aa'~a~:uXk1uXuX~aa~aK=1^a:kaaaaaA@aa!::a::aaXX':xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNgggHHH0H==HHHHHH2HHHH200RRH%%HHXXmHHgHZwwPP0RH2"ggHgRggH)H00gXgggggggggg0HgHPHg`H0Hg@HRgobggggggggggEgggggg}`Xog=UgggggggHgggggggHggggHgggggggggggggggggggggggggggggggggggggggggggg0ggg0ggg0ggg0ggggggggggggggX`PXP`@`8`@o@g@8(o@`PPg@`Ho@gXXHXHH`@g@`XgPoXXXX8@((@@@X@XXXXi00HHHHHHHXXXXXXXXXXXXXXXXXXX8888888@@@@@@@@@@@@@@@@@@@@((((((((((((@@@@@@@@@@@@@@@@@@@XXXXXXXXXXXXXXXXXXXX0Xg`o8ogXH@0"m^FFYާ8SSaFSFFFFõF}еçõ짧FFFu8}F88}8ЋS}F}}}}TATSFSS*SSSSSSSSSSF޵}FFFFFFFFËËËË}ÙË}}}}}ËËËËËËFFFFF8FF}}88888ËËSSS}}}}FFF쵧}}}}8S}F}}ËKXFS][0SSSS}}8SF2p}wC:SF2p}wCL+e:1e2PkC P)i:1eLi2p}wC  k!T/'ACT2p}wCxxxxxxxxxxxxxxxxxxxxxxxxxxxxNxxxPxffxxxxxxTxxxxTPPx>>xxxxxPxT"xxExPPPxxxxPxkxsfxxxPPPPu]Kuuu]kCCkkkkPPxxxxxxx]]]]]]]kkkkkkkkkkkkkkkkkkkkCCCCCCCCCCCCkkkkkkkkkkkkkkkkkkkP]xkP"m^'/BNN|e'//6R'/''NNNNNNNNNN//RRRVeeee]Vme'NeVuem]me]Ve]]]V/'/RN'NVNVN/VV''N'|VVVV6N/VNmNNF6'6R/'////////////V'eNeNeNeNeN|eN]N]N]N]N''''''''eVmVmVmVmVeVeVeVeV]NeNeVmVmV]NeNeNeNeNeNeNeNeV]N]N]N]NmVmVmVmVmVmVeVeV''''''''NeNV'V'V'V'V'eVeVeVeVmVmVe6e6e6]N]N]N]NV/V/V/eVeVeVeVeVeVm]NVFVFVFeVV'eVe6]NV/]N]NeVmVeVK1'NN/VNNNNN43NggN!FFN//NNVV'FxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNgggHHH0@::HH~HHHH2HHHH200JJH%%HHXXmHHgHUwwPP0JH2"ggHgKggH)H00gXgggggggggg0HgHPHg`H0Hg@HRgo]ggggggggggBggggggw`Xog=UgggggggHggggggg@gggg@gggggggggggggggggggggggggggggggggggggggggggg0ggg0ggg0ggg0ggggggggggggggXZPXP`@Z8]@jHg@0(e@`PPj@`Hg@gXRHXHHZ@g@`XgPoXXXX8H((@@@X@XXXXi00HHHHHHHXXXXXXXXXXXXXXXXXXX8888888HHHHHHHHHHHHHHHHHHHH((((((((((((@@@@@@@@@@@@@@@@@@@XXXXXXXXXXXXXXXXXXXX0RgZj0ggXH@0"m^1:Saa~1::Df1:11aaaaaaaaaa::fffk~~~~uk~1a~k~u~uk~uuuk:1:fa1eeee]Vme'NeVuem]me]Ve]]]VD1Df:1::::::::::::k1~a~a~a~a~a~auauauaua11111111~kkkkk~k~k~k~kua~a~kkkua~a~a~a~a~a~a~a~kuauauauakkkkkk~k~k11111111a~ak1k1k1k1k1~k~k~k~kkk~D~D~Duauauauak:k:k:~k~k~k~k~k~kuakXkXkX~kk1~k~Duak:uaua~kk~kK=1aa:kaaaaaA@aa*XXa::aakk1XxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxN```I`UU``````@````@@@gg`55``uu```nnn@g`@"`y`婩7`@@u@``j``@`U`n\uRrŊ```@@@@΀ujujUKuUUUK5UjjU`Uuu`u``uUuUujuuuuKU55UUUuUuuuu@@```````uuuuuuuuuuuuuuuuuuuKKKKKKKUUUUUUUUUUUUUUUUUUUU555555555555UUUUUUUUUUUUUUUUUUUuuuuuuuuuuuuuuuuuuuu@uKuu`U@2ۋ9oV t x ["m^FSw޵FSSaFSFFSSõFеçõ짧SFSFz8ozzzaFaSFSS*SSSSSSSSSSF޵FFFFFFFFÙÙÙÙÙÙÙÙÙÙÙÙFFFFFFFFFFFFFÙÙaaaSSSç}}}FaSÙKXFS][<}}SSF}F2p}wC:SF2p}wCL+e:1e2PkC P)i:1eLi2p}wC  k!T/'ACT2p}wC )i:1eLi2p}wC  =SF-n2x(CX :SF?b2x4vCFFFFFFFFFFFFFFFFFFF-------33333333333333333333 3333333333333333333FFFFFFFFFFFFFFFFFFFF&FSMY-YSF:3&CourierTimes RomanHelveticaHelvetica BoldHelvetica ObliqueHelvetica Bold ObliqueP`gggg`000HH0SMSSMEYY-7YMmSYEYS@MSSsSSMHHHH0HHHHH0HHHHHHHHP(gHgHgHgHgHgg@`@`@`@`@8(8(8(8(gPoHoHoHoHgPgPgPgPgHgHgPoHoHgHgHVPgHgHgHg?g?g@g@ga_?`@`@_?oHpHoHoHoHoHoP6(8(8(8(REoP_(_9`(`8`(gPgrgPgPpHoHjg?g?g@P6P8P6P8_9_1gPgPgPgPgPgPggH_?`@_?gP`(gPg@P8`0gHgHgaoHgP0HH000WxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNgggHHH0H==HHHHHH2HHHH200RRH%%HHXXmHHgHZwwPP0RH2"ggHgRggH)H00gXgggggggggg0HgHPHg`H0Hg@HRgobggggggggggEgggggg}`Xog=UgggggggHgggggggHggggHgggggggggggggggggggggggggggggggggggggggggggg0ggg0ggg0ggg0ggggggggggggggS`MXF`M`M`MoYgS8-oY`MmgS`MoYgSXFXF`MgS`MgSoYXFX8@((@@@X@XXXXi00HHHHHHHXXXXXXXXXXXXXXXXXXX8888888@@@@@@@@@@@@@@@@@@@@((((((((((((@@@@@@@@@@@@@@@@@@@XXXXXXXXXXXXXXXXXXXX0Xg`o8ogXH@0"m^FSw޵FSSaFSFFSSõFеçõ짧SFSFSFFFޙaSË}aFaSFSS*SSSSSSSSSSF޵FFFFFFFFÙÙÙÙÙÙÙÙÙÙÙÙFFFFFFFFFFFFFÙÙaaaSSSç}}}FaSÙKXFS][<}}SSF}jkkjxxxxxx[C[C[C[CxxC`CRCxx[[[[[[[[Ck[[[xC[[CkkxPxxPPPWxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNxxx[xkkxxxxxxPxxxxPPPxCCxxxxxPx%P"xxExPPPxxxxPxkxsfxxxPPPPuu]Kuuuuu]kCCkkkkPPxxxxxxx]]]]]]]kkkkkkkkkkkkkkkkkkkkCCCCCCCCCCCCkkkkkkkkkkkkkkkkkkkP]xkP"m^8C_oo8CCNu8C88ooooooooooCCuuuzÐz8ozzzC8Cuo8ozozoCzz88o8zzzzNoCzooodN8NuC8CC!CCCCCCCCCCz8oooooȲooooo88888888zzzzzzzzzoozzzoooooooozoooozzzzzzzz88888888ooz8z8z8z8z8zzzzzzȽNNNoooozCzCzCzzzzzzozdzdzdzz8zNozCoozzzKF8ooCzoooooJIoo0ddoCCoozz8djkkjxxxxxxxRCPCPCPCxkkCVCCCxxxxx[[[x[x[x[x[VCxxxxxxk[[[xCx[x[CkkxxPxxPPPWxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNxxxPxooxxxxxxTxxxxTPPxxxCCxxxxxxxPxx%T"xxxExPPPxxxxPxkxofxkkPPPPk]kxkPCkkxkxxxkk]xCCkkkkPPxxxxxxx]]]]]]]xxxxxxxxxxxxxxxxxxxxCCCCCCCCCCCCkkkkkkkkkkkkkkkkkkkPPxkP2 ^/"m^88Goo,CCNu8C88oooooooooo88uuuo˅z8dozz888^o,oodoo8oo,,d,ooooCd8oddddC4CuC8CC!CCCCCCCCCCz8oooooȲdoooo88888888ooooooooodoozodoooddddooooooooooooo88888,88ddo,o,o,o,o,ooooooȽCCCddddz8z8z8oooooodzdzdzdoo,oCdz8ddoooKF8koCzoooooJIoo&CCoCCoodd,CF2p}wC:SF2p}wCL+e:1e2PkC P)i:1eLi2p}wC  k!T/'ACT2p}wC )i:1eLi2p}wC  =SF-n2x(CX :SF?b2x4vC/xC8?zF:x2x4vCX :SF?b2x4vCz&`5,I`2p}wCfxxxPPPPk]kkk]Ckkxkxxxkk]kCCkkkkPPxxxxxxx]]]]]]]kkkkkkkkkkkkkkkkkkkkCCCCCCCCCCCCkkkkkkkkkkkkkkkkkkkP]xkP"m^,5LYYt,55>],5,,YYYYYYYYYY55]]]bttttkb|t,Ytbt|k|tkbtkkkb5,5]Y,YbYbY5bb,,Y,bbbb>Y5bY|YYP>->]5,555555555555b,tYtYtYtYtYtYkYkYkYkY,,,,,,,,tb|b|b|b|btbtbtbtbkYtYtb|b|bkYtYtYtYtYtYtYtYtbkYkYkYkY|b|b|b|b|b|btbtb,,,,,,,,YtYb,b,b,b,b,tbtbtbtb|b|bt>t>t>kYkYkYkYb5b5b5tbtbtbtbtbtb|kYbPbPbPtbb,tbt>kYb5kYkYtb|btbK8,YY5bYYYYY;:YvvY&PPY55YYbb,PxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNdddCd]]ddddddFddddFCCddd88ddzzdddkddCddF"Ȑddd尰9dCCȐzȰCdzdodȐȅdCdYdsȐ]ȐȐȧzȐUvŐdȐYYCCCCzzzozoYzNoYdYC8YooYdYzzdzddoYoYzzozzzzNd88YYYzYzzzzCCdddddddzzzzzzzzzzzzzzzzzzzNNNNNNNdddddddddddddddddddd888888888888YYYYYYYYYYYYYYYYYYYzzzzzzzzzzzzzzzzzzzzCszzCozdYC"m^8C_oo8CCNu8C88ooooooooooCCuuuzÐz8ozzzC8Cuo8ttttkb|t,Ytbt|k|tkbtkkkbN8NuC8CC!CCCCCCCCCCz8oooooȲooooo88888888zzzzzzzzzoozzzoooooooozoooozzzzzzzz88888888ooz8z8z8z8z8zzzzzzȽNNNoooozCzCzCzzzzzzozdzdzdzz8zNozCoozzzKF8ooCzoooooJIoo0ddoCCoozz8dxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNtttPPP5PDDPPPPPP8PPPP855\\P))PPbbyPPtPeYY5\P8"ttPt\ttP厎.P55tbtttttttttt5PtPYPtkP5PtGP\t|nttttttttttMttttttkb|tD_tttttttPtttttttPttttPtttttttttttttttttttttttttttttttttttttttttttt5ttt5ttt5ttt5ttttttttttttttbkYbYkGk>kG|GtG>,|GkYYtGkP|GtbbPbPPkGtGkbtY|bbbb>G,,GGGbGbbbbu55PPPPPPPbbbbbbbbbbbbbbbbbbb>>>>>>>GGGGGGGGGGGGGGGGGGGG,,,,,,,,,,,,GGGGGGGGGGGGGGGGGGGbbbbbbbbbbbbbbbbbbbb5btk|>|tbPG5"m^''2NN|]//6R'/''NNNNNNNNNN''RRRN]]ee]Vme'F]Nuem]me]Ve]]]V'''BNNNFNN'NNFuNNNN/F'NFeFFF/$/R/'////////////V']N]N]N]N]N|eF]N]N]N]N''''''''eNmNmNmNmNeNeNeNeN]F]NeNmVmN]F]N]N]NeFeFeFeFeN]N]N]N]NmNmNmNmNmNmNeNeN'''''''F]FNNNNNeNeNeNeNmNmNe/e/e/]F]F]F]FV'V'V'eNeNeNeNeNeNe]FVFVFVFeNNeNe/]FV']F]FeNmNeNK1'KN/VNNNNN43NggN//N//NNFF/xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNdddCdUUddddddFddddFCCssd44ddzzddd~ooCsdF"Ȑdsd岲9dCCȐzȲCddodȐȅdCdYdsȐ`ȐȐȮzȐUvŐdȐddCCCCΐtkzbkkk|tN>|ktk|tzbzbktkt|zbzNY88YYYzYzzzzCCdddddddzzzzzzzzzzzzzzzzzzzNNNNNNNYYYYYYYYYYYYYYYYYYYY888888888888YYYYYYYYYYYYYYYYYYYzzzzzzzzzzzzzzzzzzzzCzNzdYC2%]2ԭTCourierTimes RomanHelveticaHelvetica BoldHelvetica ObliqueHelvetica Bold ObliqueSymbolN(((<<(5<5<5(<><q*"xxxxWWxxxWWkkxxxdd$YYdCCddooCYqnnn!8nBBnnnyyPn7c1RyyXyycnnnndccccccccMMMMMMMMMMMMы~nyRzcXcyhFBnnshcnntnvyX~Xsyn~XyBBnss~y~~~~~~~~~~~~~~~~~~~XXXXXXXyyyyyyyyyyyyyyyyyyyyBBBBBBBBBBBBnnnnnnnssssssssssssFFnŐdȐddCCCC΅zozoYNzYYYN8YooYdYzzdzddzYzYzozzzzNY88YYYzYzzzzCCdddddddzzzzzzzzzzzzzzzzzzzNNNNNNNYYYYYYYYYYYYYYYYYYYY888888888888YYYYYYYYYYYYYYYYYYYzzzzzzzzzzzzzzzzzzzzCzNzzdYC"9 ^'/9FFum///FM#M#'FFFFFFFFFF''MMM>e]]eVNee/6eV|eeNe]NVeeeeV/'/BF/>F>F>/FF''F'mFFFF/6'FFeFF>CCLK@#?F/>FFFFF'+FooF>>F//FF}NN/>iiii\OMMMd'M..MMMdldddTT8M&sdE#:`oTTldddd=slllTT\EMyMMddd```MFEEEEEEEE666666666666aX\MT:VE[=[EkThI1.eM`MQgIZEiMlMQMST=X=aQkTcMo`l`X=T..MQQ`XaTdXXXXXXXXXXXXXXXXXXX=======TTTTTTTTTTTTTTTTTTTT............MMMMMMMQQQQQQQQQQQQ````````````````````a[k1ial1aMT/'ACT2p}wC )i:1eLi2p}wC  =SF-n2x(CX :SF?b2x4vC/xC8?zF:x2x4vCX :SF?b2x4vCz&`5,I`2p}wC/xC8:x2p}wCX1sC8-:s2x(CXXLj"Q/'ˏQ2PkCPxxxxxxxxo]>xxsoox>>YYxxxxxxx>>>>>>>>>>>>Y]xkP"m+O6^??d~~?QQ~???Y~~~~~~~~~~??Ƚ]soh?Qkh~h~zUYUdd?]k]o`?`k00`0kookJFCk``dNYdY~?~~~~~?~~~~~~d~v0]]]]]Ĕ]o`o`o`o`?0?0?0?0kooookkkkd]toodohol]lll]]tlo`o`tl`t````k80?0?0?0`Q`l0lPk0kJzFttktoȪHH~JdhFdhF|\|Hktkktkdx`zNx`ok0k~JhF~Cddok?dd???WddddddddddddddddddddddddddddddddddddddddNd~~?]]]~~~NN~N]dd~N??kk~44~~zzdddvkk?kdN"Ȑdsd彽9dCCȐvȽ?dho~ȐȔd?kd~sȐkȐȐȧzȐUvŐdȐYYQQUUΟoskodko]zUsk?0dhoo~UsshkvvY~]k`o]s00skkko??~~~~~~~ooooooooooooooooooo]]]]]]]ssssssssssssssssssss000000000000ssssssskkkkkkkkkkkk?so?dYC2dW W(T?xxx x6X@KX@7oC2o\  PCXPL1sC88:s2PkCXP4/xC8:x2p}wCXL=SFw2PkCP :SF2p}wC:SF2p}wCL+e:1e2PkC P)i:1eLi2p}wC  k!T/'ACT2p}wC )i:1eLi2p}wC  =SF-n2x(CX :SF?b2x4vC/xC8?zF:x2x4vCX :SF?b2x4vCz&`5,I`2p}wC/xC8:x2p}wCX51sC8-:s2x(CXX Loj"Q/'ˏQ2PkCPD1mC8VK:m2PAXPDj"L/'V{vL2PAPsvodszd]szN4ddvo`szsz]~]vosds44svvsJJsssssssssssssssssssdddddddssssssssssssssssssss444444444444sssssssvvvvvvvvvvvvJzzNdYC"4|Jx ^LLxLbbLLLkLLo|Lb||fkfxxLoosLs::s:YTPssx]kxkLLx:oooooossssL:L:L:L:xox|ooosssssssC:L:L:L:sbs:`:YTVVYx|Tx|TnVxs]s:Y|TPxxLxxLLLWddddddddddddddddddddddddddddddddddddddddNxLooo]]]oxx]LL>>xxxLx.]"xxExPPLx|xLxfxkkbbffxofL:x|f|koso::LLooooooo::::::::::::LLxkP"m+O6^--HZZ}-::Z---@ZZZZZZZZZZ--BrRbePJom-:bMu}J}ZJZrob]X=@=HH-BMBPE-EM##E#wMPPM520MEeEH8@H@Z-ZZZZZ-ZZZZZZHZU#rBrBrBrBrBjbBPEPEPEPE-#-#-#-#uM}P}P}P}PrMrMrMrM]HrBmS}P}P]HmPJPjMrBjMdMdMbBbBgjSMPEPESMoEjSoEoEoEoEmM(#-#-#-#bE:bEM"M9M#M5X2gSujgSuMmS}Pz\4\4Z5\HJ2\HJ2YBY4rMgSrMrMgSrMe]HVEX8VEePM#uMZ5J2Z0]H]Hej}PrM-HH---WddddddddddddddddddddddddddddddddddddddddNgggHZZ-BBBZZzZ88Z8BHHZ8--MMZ%%ZZXXmHHgHUuuMM-MH8"ggHgRggH凇)H00gUgggggggggg-HrJPZgjH-MgHZRgo]ggggggggggMggggggw`Xog=UgggggggHggggggg@gggg@gggggggggggggggggggggggggggggggggggggggggggg:ggg:ggg=ggg=gggggggggggggrPRMPHjMPBX=mRmM-#bHjJPuPZ=}RgRJMUU@ZB]MuebErbjmPBR##RMMmMPmbbi--ZZZZZZZPPPPPPPPPPPPPPPPPPPBBBBBBBRRRRRRRRRRRRRRRRRRRR############RRRRRRRMMMMMMMMMMMMmmmmmmmmmmmmmmmmmmmm-RrPm-}]jH@0CourierCourier BoldCourier ItalicCourier Bold ItalicCG TimesCG Times BoldCG Times ItalicCG Times Bold ItalicAlbertus Semi-BoldAlbertus Extra-BoldCG Omega Bold Italic2 [,"m+O6^GGnG``GGG`GG\unKUn|gy`````G`u\rcGjr99y9rurrRRNrjyjY```GG`|9`````Ò\ucucucucK9K9K9K9ruuuurrrrj`ouuju|rh`hhh\\ohucucohjojjjjr69K9K9K9rUyh.hMn9n\y\oorou{E{ER{`gR{`gRwXwErorrorjs\Ys\rn9rRgRyNjjurG``GGGWddddddddddddddddddddddddddddddddddddddddN`G\ccʀYYY\``YGG||99uu```yyG|`Y"``弼7`@@uG`jr\Grjn`uRrŊ```````Εnrj`nu`YnuK2``rj\nu|nu|YyYrjn`n22nrrn|GGnnnnnnnnnnnnnnnnnnn```````nnnnnnnnnnnnnnnnnnnn222222222222nnnnnnnrrrrrrrrrrrrGuuK`U@"4|Jx ^YYYxxYYYxYYs]kxxxxxYunKUn|gyxxxYYxGxxxxxs||||]G]G]G]Gxxss||CG]G]G]Gk:`GssVVfxfxfnVsosGffbYxxYYYWddddddddddddddddddddddddddddddddddddddddNxYs||ooosxxoYYGGxxxYx 3o"xxE$xPPYxsYxfxxxxxxxju]K|uyx>>YYxxxxxxx>>>>>>>>>>>>Y]xkP"m+O6^55R``5HH`555H``````````55EoegoXRou8@jRz]eMZumm``HHHHH5YQSYFBY^-3UBqbhKhQ>H^WqWMMHHH`5`````5``````H`]*oHoHoHoHoHmgEXJXJXJXJ8*8*8*8*zUXXXXuUuUuUuU`PoHuSXX`PuX]UjMoHjMdMdMgEgEgjSMXJXJSMoPjSoPoPoPoPuU(*8*8*8*wU@jZM"M9R*REZEgSzgSzUmSX\4\4e=\HM=\HM=YBY4uUgSuUuUgSuUr`PVE`BVEoUR*zUe=M=Z:`P`PojXuU5HH555WddddddddddddddddddddddddddddddddddddddddNgggH``5EJJ```BB`BEHH`B55]]`**``XXmHHgHeZZ5]HB"ggHgeggH卍)H00gXgggggggggg5HoPU`ujE5UgP`RgobggggggggggHgggggg}`Xog=UgggggggHgggggggHggggHggggggggggggggggggggggggggggggggggggggggggggHgggHgggHgggHgggggggggggggoYeQP@jUXF`Mu^mW8-jUjUqzbgShu^]KXFZH`MjmWju^RHR%%RUUoR]obgi55```````RRRRRRRRRRRRRRRRRRRHHHHHHHRRRRRRRRRRRRRRRRRRRR%%%%%%%%%%%%RRRRRRRUUUUUUUUUUUUoooooooooooooooooooo5XoXu8`uH@0"m+O6^55R``5HH`555H``````````55EoegoXRou8@jRz]eMZumm``HHHHH5HXEUJ5PU**Z*UXUU==:UPrZPBHHH`5`````5``````H`]*oHoHoHoHoHmgEXJXJXJXJ8*8*8*8*zUXXXXuUuUuUuU`PoHuSXX`PuX]UjMoHjMdMdMgEgEgjSMXJXJSMoPjSoPoPoPoPuU(*8*8*8*wU@jZM"M9R*REZEgSzgSzUmSX\4\4e=\HM=\HM=YBY4uUgSuUuUgSuUr`PVE`BVEoUR*zUe=M=Z:`P`PojXuU5HH555WddddddddddddddddddddddddddddddddddddddddNgggH``5EJJ```BB`BEHH`B55]]`**``XXmHHgHeZZ5]HB"ggHgeggH卍)H00gXgggggggggg5HoPU`ujE5UgP`RgobggggggggggHgggggg}`Xog=UgggggggHgggggggHggggHggggggggggggggggggggggggggggggggggggggggggggHgggHgggHgggHgggggggggggggoReUPHjRXH`BuRmX8%jHjHUzPgERuX]RX]BZB`UgmPguoRHR%%RUUoR]obgi55```````RRRRRRRRRRRRRRRRRRRHHHHHHHRRRRRRRRRRRRRRRRRRRR%%%%%%%%%%%%RRRRRRRUUUUUUUUUUUUoooooooooooooooooooo5XoXu8`uH@02 / "m+O6^++BMMqh+::Mq+++:MMMMMMMMMM++sqs7qYQSYFBY^-3UBqbhKhQ>H^WqWMM:::::+:F7D<+@D""H"fDFDD11/D@\H@5:::sM+MMMMM+MMMMMM:MK"Y:Y:Y:Y:Y:uWS7FY:U>Q>Q>S7S7SUC>FY@UCY@Y@Y@Y@^D "-"-"-"`D3UH>>.B"B7H7SCbfSCbDWChFfJ)J)Q1J:>1J:>1G5G)^DSC^D^DSC^Dq\M@E7M5E7YDB"bDQ1>1H/M@M@YUhF^D+::+++WssssssssssssssssssssssssssssssssssssssssssssssssddddddddddddddddddddddddddddddddddddddddNSSS:MM+7<>xxxCox3T"xxExPPCxsCxfxxxCCCCujx`uP@ujujuux>>CCxxxxxxx>>>>>>>>>>>>CxPxkP"4|Jx ^CCoCCCCCCCCCkxxPPxxCCCxxCxsxPxCCxC]]PxxxxxxxCCxCxxxxxsxxxxxxxxPCPCPCPCxxxxxxxjjssjxxxxjxxxxxx[CPCPCPCPxC`xCx]xCx[[][x][x][Cx[x[xC]x]PxxCxxCCCWxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNxCkffYYTxxxTCCkk>>xxxCox3T"xxExPPCxsCxfxxxCCCCxxxoP>xxsoox>>CCxxxxxxx>>>>>>>>>>>>CxPxkP"m+O6^55Yjj555j5555jjjjjjjjjj55Uu``@@u`ju`juuu555``5`j\j`@`j55`5jjjjKK@j```````j5jjjjj5jjjjjj`jj5`````\````````@5@5@5@5jjjjjjjjju```jju`jjj```TT\\{T````T``````jI5@5@5@5j@u`s6sM`5`K`5kkj`jIIuKkI`KkI`KsIs6jkjjkju`sIu`sIj`5juK`Kj@u`u`{jj5``555WxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxN`jj5URRjjjGGjC```jC55UUj22jjuu```yrr5Y`C"`j`媪7`@@u5`jrj\5jjjn`uRrŊ```5555΀nurj`n``uYnu@2u``rj\nujnu|YjYurujn`n22nrrn|55jjjjjjjnnnnnnnnnnnnnnnnnnn```````nnnnnnnnnnnnnnnnnnnn222222222222nnnnnnnrrrrrrrrrrrr5u`@u`U@2&   T!"4|Jx ^88]oo888o8888oooooooooo88YzddCCzdozdozzz888dd8do`odCdo88d8ooooNNCodddddddo8ooooo8oooooodoo8ddddd`ddddddddC8C8C8C8ooooooooozdddoozdooodddXX``XddddXddddddoL8C8C8C8oCzdx8xPd8dNd8ppodoLLzNpLdNpLdNxLx8opoopozdxLzdxLod8ozNdNoCzdzdoo8dd888WxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxNdoo8YUUoooJJoFdddoF88YYo44oozzddd~vv8]dF"dod9dCCz8dovo`8ooosdzUvddd8888szvodsddz]szC4zddvo`szosz]o]zvzosds44svvs88ooooooosssssssssssssssssssdddddddssssssssssssssssssss444444444444sssssssvvvvvvvvvvvv8zdCzdYC"m+O6^;;\kk;PPk;;;Pkkkkkkkkkk;;M|qt|b\|>Gv\hqVeyykkPPPPP;PbM_S;Y_//e/_b__DDA_YeYJPPPk;kkkkk;kkkkkkPkh/|P|P|P|P|PytMbSbSbSbS>/>/>/>/_bbbb____kY|P]bbkYbh_vV|PvVpVpVtMtMsv]VbSbS]V|Yv]|Y|Y|Y|Y_-/>/>/>/_GveV&V@\/\MeMs]s]_z]bf:f:qDfPVDfPVDcJc:_s]__s]_kY`MkJ`M|_\/_qDVDeAkYkY|vb_;PP;;;WddddddddddddddddddddddddddddddddddddddddNtttPkk;MSSkkkJJkJMPPkJ;;hhk//kkbbyPPtPqee;hPJ"ttPtqttP坝.P55tbtttttttttt;P|Y_kvM;_tYk\t|nttttttttttPttttttkb|tD_tttttttPtttttttPttttPttttttttttttttttttttttttttttttttttttttttttttPtttPtttPtttPttttttttttttt|\q_YPv\bPkJ\yb>)vPvP_YtM\bh\bhJeJk_tyYt|\P\))\__|\h|ntu;;kkkkkkk\\\\\\\\\\\\\\\\\\\PPPPPPP\\\\\\\\\\\\\\\\\\\\))))))))))))\\\\\\\____________||||||||||||||||||||;b|b>kPG5"4|Jx ^JJsJddJJJdJJ`zsNYsk~dddddJ|qt|b\|>Gv\hqVeyykkdddJJd;ddddd`zhzhzhzhN;N;N;N;vzzzzvvvvodtzzozvldlll``tlzhzhtlotoooov8;N;N;N;vY~l0lPs;s`~`ttvtzHHUdkUdkU|\|Hvtvvtvox`]x`vs;vUkU~QoozvJddJJJWddddddddddddddddddddddddddddddddddddddddNdJ`hh]]]`dd]JJ;;zzddd~~Jd]"dd9dCCzJdov`JvosdzUvddddddd|qoYvzbkyN>vvthzb~ekysds44svvsJJsssssssssssssssssssdddddddssssssssssssssssssss444444444444sssssssvvvvvvvvvvvvJzzNdYC"m+O6^&&][&1R@obh>hL>L`]qRNI353<<&8@8C:&:@:d@CC@,*(@:T:CYA`8YATATAR8R8VYFAC:C:FA]:YF]:]:]:]:[@"&&&R:1R:AA0@@,I*VFbYVFb@[FhCxfM+M+L,M<>*M<>*J7J+`@VF`@`@VF`@qTN*L(NCLqxWxY<&@WoCbCL3hEWE>@GG5L8N@bTR:`RY[C8EE@@[@C[RRX&&LLLLLLLCCCCCCCCCCCCCCCCCCC8888888EEEEEEEEEEEEEEEEEEEEEEEEEEE@@@@@@@@@@@@[[[[[[[[[[[[[[[[[[[[&E`C[&hNY<5(2$?&|+@"m+O6^,,EPPvm,<,CG$$L$kGIGG331GC`LC8<<I>I>I>/$/$/$/$fGmImImImIbGbGbGbGPC]I>FA]CYF]C]C]C]CbG"$/$/$/$dG5YLAA0E$E:L:VFfkVFfG[FmIkM+M+T3M<@3M<@3J7J+bGVFbGbGVFbGv`PCH:P8H:]GE$fGT3@3L1PCPC]YmIbG,<<,,,WxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxddddddddddddddddddddddddddddddddddddddddNWWW<PP,:>>PPP88vvP8:<PG,_ 7*0 x]7 2r@9,_?r*0 x]7?!>PG,_ 7*0 x]7 tt,b5/,Ab_ pi7!"7zC;,AԍXz_ pi7X""6uC;,O Xu&_ x7XX%6"V"G($,8hG PE37hP"4wC;,_Xw*0 x]7X>F"0|C?,t*$X| p.7X(665'G"2CJ,X? p7X4>":PL,t  p.7,0)H";PY,|? p7+0@G,m"Y0-,t6?Y p.7-l#_05,#_? p7/VL&+,%YL? p7Y.-J"l#_05,#_? p7/ BPC,SF NxG702 5s@5,?sF NxG7?10K"BPC,SF NxG702x(j5;,$j? p73'L"2CJ,X? p7X4 "7xC8,YIXxF NxG7X5>N"[J(&,t1\hJ p.7h7ZO(,,phO? p7hsistema"st~sintctic"st~syntaxique"$ssyntactic"su~supon"su~$su~suppos"tv~2V?6@cA "} v p# =ك  e  t=ك  e3  o ۟ESES .,,. 6&&ein wittgensteiniana wittgensteiniano6&StandardII.PS)LAURENTI.PRSx  6&finitif@p@@FF MMx6&Standardius_PostScript_(hh  #XpiP;rEXP# hh   #X| p.78X# v *Yo ESUKӊ= jC B  C1Compatible Transitive Extensions of System CT  by Lorenzo Pe9a`r"#Hă   y]dddy *  [  C1ĩCompatible Transitive Extensions of System CT  RO !Q vv  Logique et Analyse  N 161162163 (1998) %pp. 135143  Pn $~ Lorenzo Pe9a  R CSIC Institute of Philosophy 'Madrid   *  RK * Da Costa's paraconsistent systems of the series Cm (for finite m) (see [C1], [C2],  R4 and esp. [C3], pp. 237ff.) share important features with transitive logic, TL (which has been gone into in [P1] and [P2]), namely, they all coincide in that: (c1) they possess a strong negation, `', a conditional, `D', a conjunction, `U', and a disjunction, `V', with  R respect to which they are conservative extensions of CL or Classical Logic; (c2) they  R possess a nonstrong negation, `N' (notations are different for systems C) which does not possess all properties of classical negation, but for which the following schemata are theorematic (I use the letters `p', `q', etc as schematic letters; my notational conventions are basically Church's: associativity leftwards; a dot stands for a left parenthesis with  R its mate as far to the right as posible):  pVNp ,  NNpDp ,  pDNpDNp ; (c3) they possess a monadic functor, `#', for which the following schemata are theorematic:  RR  N#pD.pUNp ,  #pU#qD.#(pVq)U#(pUq)U#(pDq)U#Np ; (c4) they are almost unique anong paraconsistent logics in their having the three aforementioned features. (In  R$ general systems with features of that sort have been called `extensional paraconsistent  R  logics' by Diderik Batens, who has also proposed systems bearing a kinship of sorts to those " even though they lack strong negation and a classicality operator, they can be easily extended in that way; see [B1].)  R> A difference between TL and the systems C is that in C functor `#' is defined through negation, `N', and conjunction, `U', and then strong negation, `', is defined with  R! those three functors, whereas in TL either `#' is taken as primitive, or else strong  R! negation is taken as primitive (in which case  #p  is defined as  pVNp ), or another  R" primitive functor is introduced, one of strong afirmation, `H', such that  p  is then  R# defined as  HNp  and  #p  as (e.g.)  H(pVNp)  (strong affirmation distributes over conjunction and also over disjunction).  R& There are other differences between TL and systems Cn. In TL some schemata  R' hold which do not hold in C, such as  N(pUNp) ,  pDNNp ,  pVqN(NpUNq) ,  R'  pUqN(NpVNq) . Moreover, in TL there exist several primitive functors which do not  R( exist in C, such as: (f1) an equivalential functor, `', for which the rule of inference  R) pq, r  s holds, where  r  differs from  s  only by substituting to one or more  R* occurrencess of  p  as many occurrencess of  q ; (f2) a functor of minimal affirmation,  R+ `Y', such that this schema holds:  YqD.qUpqp  (or, abbreviating  qUpq  as  qp :  Rz,  YpD.q.pq ); a strong conjunction, `', such that  pq.pUq , but not conversely, `'z,=o.o.o. being endowed with the properties of classical conjunction save idempotence (the  R schema  ppp  does not hold). Such complicated pattern of relations has led us to find out a system with all the  R1 properties shared by TL and systems Cm (for m finite) and to see how it can be  R strengthened with properties of TL while remaining Cĩcompatible.  R} Definition: a system S is Cmĩcompatible iff Cm is an extension of a system of  Rf which S is also an extension and, if the schemata which are theorematic in Cm but not  RO in S are added to S, the result is a paraconsistent system (for negation `N'), i.e. it does not have the inference rule: p, Np  q.  R I shall show below that aystem CT " to be sketched out in a moment " is  R such that both TL and Cm (for m<) are extensions thereof. (I shall also show that, if  Rk we reinforce CT by adding certain functors and theorematic schemata of TL , we get  RV systems some of which are C1ĩcompatible.) My hypothesis (which will not be proved  R? here) is that system CT is the strongest system with such a feature.  R & System CT ă Primitive symbols: V, U, N, #.  R^ Definitions:  Sp  abbreviates  pUNp ;  p  abbr.  #pUNp ;  pDq  abbr.  pVq ;  pq   RG  pDqU.qDp .  R Inference rule: modus ponens (p, pDq  q)  R / *! Axiomatic schemata :Yo Y# Ѓ  Rf ( Export ) pUqDrD.pD.qDr  R ( Transit ) pDqU(qDr)D.pDr  R( ( L-simpl. )  pUqDp  R ( R-simpl. )  pUqDq  R ( L-addition ) pD.pVq  RK ( R-addition )  qD.pVq/  R ( Conv2Neg ) NNpDp  R ( Chrisippus ) #pVSp  Rn! ( hered ) #pU#qD.#(pVq)U#(pUq)U#Np  R" ( Clas-Clas ) ##p  R0$ ( Conj2Disj ) pDrU(qDr)D.pVqDr  R% ( Conj2Conj ) pDqU(pDr)D.pD.qUr  R& (Notice that this axiomatization is heavily indebted to the one proposed for CL by Prof. Hubert Hubien in his paper [H1].)  R<) This system is stronger than C3 but less strong than Cm (for m finite).  R* Now I am going into some crucial points concerning system CT.*o.,,55ԌIt seems to be in order to propose readings of our symbols. Not that da Costa has always bothered to provide us with such readings; more often than not he hasn't, except in so far as `N', `V', `U' and `D' are concerned. Oddly enough he has failed to  R offer any naturallanguage reading for either `(m)' (our `#') or `', or strong negation. #p  can be read as It is a classical matter whether or not p , where a classical matter is a disjunction between two entirely opposite situations each of which either completely holds or else does not hold at all. Likewise p  can be read as It is not the case that p at all ; Hp  as It is fully the case that . `' is read `if, and only if'.  R In CT we easily prove the four following results:  R (R1) Chrisippus's principle " namely  #pVSp  " is, in the presence of the other  R axiomatic schemata and inference rules, equivalent to  N#pDSp , i.e. the assertion that whatever fails to stand by classical strictures is contradictory. Proof: first we prove  R  pDp , hence (by definition)  pVp  and  pVqD.qVp . By instantiation we have  R Ԛ pVp , hence  pDp . We thus prove  pDqD.qDp . We also prove de Morgan:  R  (pVq)D.pUq  and associativity:  pVqVrD.pV.qVr . Then we prove distributivity:  R  pVqUrD.pUrV.qUr  and  pD.qD.pUq . Hence  pVqD.pDq . Then from  #pVSp  we  R| prove  #pDSp . But since  ##p  is theorematic, we have  N#pD#p ; hence  Re  N#pDSp . Q.e.d. The converse proof is also straightforward: from  N#pDSp  we get  RN  N#pVSp , hence  #N#pUNN#pVSp , hence  NN#pVSp , hence  #pVSp . Q.e.d.  R (R2) CT contains, among others, the following theoremschemata:  pDqVp   R ( Funnel ),  pDqDpDp  (Peirce),  pUpDq  (Cornubia for strong negation). The proof is  R trivial: with  pUqDrD.pD.qDr  plus  pUqDp  and  qUpDp  prove, first,  pD.qDq  and  Rl hence  pDp ; then prove (by definition)  pVp , hence (thanks to  pD.pVq  and  RU  qD.pVq )  pVpVq , i.e. e [prorsus] falso quodlibet, namely:  pD.pDq ; whence  R> Funnel follows thanks to  pDrU(qDr)D.pVqDr  and exportation; now take a particular  R' case of Funnel, namely  pDqDqV.pDq . Whence conjunctive assertion (namely  R  pDqUpDq ) follows (again thanks to  pDrU(qDr)D.pVqDr ). Peirce is proved as follows:  R by exportation we get (once we have proved  pDp )  pDqDpD.pDqVpDp  (again thanks  R to  pDrU(qDr)D.pVqDr ) and by transitivity (and Funnel)  pDqDpDp . Cornubia follows  R from e prorsus falso quodlibet plus the lemma  pD(pDq)D.pDq , i.e. absorption, which can be easily proved from conjunctive assertion.  R (R3) The fragment of CT expresible only with `D', `U', `V', `' is exactly CL .  R Proof: take any standard presentation of CL and show the equivalence between its set  R of axioms and that of CT when symbol `N' is omitted. In fact Hubien's axiomatization is but a variant of the wellknown axiomatization of Hilbert & Ackermann, which is clearly equivalentent to our positive system of axioms plus classical negation endowed with  R"  pDqD.qDp ,  pDp  and  pDp . The three are provable in CT (since  pDq   R# abbreviates  pVq ). Therefore, CT contains  CL . The converse can also be proved quite  R|$ easily, since in  CL   pVq.pDq . Thus replace the set pf Hilbert & Ackermann's primitive symbols {, D, V, U, } with {, V} and define `D' and `'. The three nonpositive axioms then become redundant or idle.  R' (R4) CT is stronger than C3 (since C3 lacks Peirce and Funnel). Proof: C3 is  R( positive (intuitionistic) logic enlarged with a very weak negation satisfying just  NNpD R) p  and  pVNp . CT is of course stronger, since it includes the whole classical positive calculus. (See (R2) above.)n*o.,,55Ԍ R We can strengthen CT by adding one or several among the following principles. (That by so doing we obtain proper strengthenings can be shown through a da Costa's valuation semantics, which is twovalued but not truthfunctional: we can easily devise  R such a semantic for CT failing to satisfy any one of the following schemata; devising it is left as an exercise to the reader):  R ( 2negation ) pDNNp  Rh ( DeMorgan-1 ) pVqDN(NpUNq)  R ( DeMorgan-2 ) pUqDN(NpVNq)  R* ( DeMorgan-3 ) N(pUq)D.NpVNq  R ( DeMorgan-4 ) N(pVq)D.NpUNq  R Let LTL , or lean transitive logic, be the fragment of TL expressible with symbols  R occurring in the CT language. LTL is the result of adding to CT all those five axioms  R plus the principle of contradiction or $nesidemus , namely:  N , where `' is a  R sentential constant with whatever meaning. We can call JTL (jejune transitive logic) the  R result of adding to CT the just mentioned principles except $nesidemus. CL is JTL plus  R the axiomatic schema:  #p . TL is of course a conservative extension of CL , but it cannot be classically strengthened  (once $nesidemus has been added, no classical meaning can be given to `N').  R  LTL and even JTL are not Cmĩcompatible (for m finite). Proof: with DeMorgan-1  R or  pVqDN(NpUNq)  we prove a variant of noncontradiction ( N(NpUNNp) ) from the  R principle of excluded middle, which is theorematic in CT . Thus with the help of  Ru  2negation or  pDNNp  (the converse of which is theorematic in CT ) we prove the general principle of noncontradiction, which of course is incompatible with da Costa's  RI systems (it collapses them into CL ).  R In fact starting with CT we obtain C1 by adding BF " or the  BacktotheFold   R principle ", which is the converseChrisippus principle, namely:  NSpD#p  " what is not contradictory is classical. (Again the proof is trivial but tedious, and is thus left to  Rg the reader. Hint: in C1 prove all axioms of CT (defining  #p  as  NSp  and thus getting  RR  BF quite cheap); then in CT plus BF prove any set of axioms of C1.) In order to obtain  R= C2 instead, we add  NSpUNSSpD#p . In general Cm is CT plus  NSpUNSSpU8UNSmpD R( #p , where `Sm' stands for a string of m occurrences of `S'. (Da Costa's original axiomatization was of course different: with U, D, V, N as  Rp! primitive, if we define `S' in such a way that  Sp  abbr  pUNp  and we have Modus  RY" Ponens as the only inference rule, the axioms are:  pD.qDp ;  ĚpDqD.pD(qDr)D.pDr ;  RB#  pD.qD.pUq ;  pUqDp ;  pUqDq ;  ĚpDrD.qDrD.pVqDr ;  pD.pVq ;  qD.pVq ;  NNpDp ;  R+$  pVNp ;  ĚNSpD.qDpD.qDNpDNq ;  NSpUNSqD.NS(pDq)UNS(pUq)UNS(pVq)UNSNp .)  R% The main idea behind adding BF " and of course, philosophically, da Costa's  Ru& chief motivation " is the noninconsistency assumption, namely that denying a contradiction entails accepting that the situation therein involved is a classical one. In other words, if and when it is not the case that both p and notp, then p is a classical situation. Whatever is noncontradictory is classical. The noninconsistency assumption has of course been questioned by many other paraconsistent logicians " including the present author ", who have argued that, ifx+o.,,55 contradictions can be true, one of those true contradictions may well be that pandnotp both obtains and does not obtain. Yet da Costa's approach enjoys two significant characteristics, or perhaps advantages. The first one is that, when somebody claims, for a certain particular situation, p, to accept both p and notp, his interlocutors are likely to rejoin: `Then you do not accept the principle of noncontradiction!'. Needless to say, other paraconsistent schools regard such a rejoinder as stemming from a classicist confusion " mistaking `not to accept s' for `to accept not-s', or `to accept r', if s=Nr. Even so, da Costa's point  R is not entirely devoid of prima facie plausibility. That constitutes the first advantage of the approach implemented in the C systems. Moreover " and this constitutes the second advantage of da Costa's preferred approach ", the noninconsistency assumption succeeds " in the absence of  R  2negation , DeMorgan-2 , DeMorgan-3 and DeMorgan-4 " in enforcing an important  R constraint, viz. the confinement of contradictions (not to multiply contradictions beyond absolute necessity): thanks to the noninconsistency assumption " or equivalently to the  R  BF principle " (plus the nonendorsement of involutivity and De Morgan), a given contradiction not only fails to render the theory deliquescent (trivial) but also fails to trigger an infinite chain of further contradictions, whereas, upon other paraconsistent underlying logics (such as a relevant or a transitive logic), once, for a certain constant `', a given theory contains both `' and `N', it is bound to also contain infinitely many  R$ different contradictions ( UNUN(UN) ,  N(VN) , etc). Now, da Costa's is not the only paraconsistent approach to have implemented the confinement constraint. In fact the late Richard Sylvan's approach often (although perhaps not always) leaned towards some sort of containment policy; but especially Graham Priest's approach is arguably a containment view (see the present writer's  R' Critical Notice: Graham Priest's Dialectheism " Is It Althogether True? , SORITES # 7 (November 1996) (ISSN 1135-1349), pp. 2856). Admittedly, those other approaches put the containment constraint to serve different purposes. Both advantages (if they are such) are of course closely related. Probably what is implicitly assumed by those interlocutors who equate asserting a contradiction with denying (and in fact rejecting) the principle of noncontradiction is that nobody is so unreasonable as to both swallow a contradiction and yet also espouse the very same denial of that contradiction. Contradictions are assumed to be bad and even irrational. Firstlevel contradictions are bad enough as they are, but adding secondlevel contradictions and so on is still more irrational. Now, all approaches implementing the confinement constraint somehow or other assume as much " namely that contradictions are bad and thus not to be endorsed except as an extreme measure, when nothing else works to solve a difficulty, and even so perhaps only temporarily. Whatever our final views on such a debate (and my own opinion is that, infinite chains being harmless, no serious mishap ensues from advocating both noncontradiction and also certain contradictions), the present discussion (or digression) makes out  R' a case for the claim that climbing up to the C systems is not a whimsical choice.  R) Let me explain. System CT is classical logic plus a very weak negation endowed  R) with only two principles: converse double negation and excluded middle. CT does not  R* prejudge any additional principles as regards negation. In fact CT can be strengthened into classical logic (thus collapsing `N' into a notational variation of `') by adding the+o.,,55  R schema  SpDq  (or  #p ). C1 is instead obtained by adding  SSpDq  (or  #Sp ); C2 is  R obtained by adding  SSSpDq  (or  #SSp ); and so on. The idea behind the strengthening into classical logic is that all contradictions " even first degree contradictions " are  R bad and unacceptable; the one behind Cn is that contradictions of (n+1)th degree are bad; and one (perhaps the) reason that can be adduced for that is that an infinite chain of deeperlevel contradictions seems baffling: you can admit p and not p  but not p and notp and not (p and not p) and 8 . At some level or other you are bound to stop, or else nobody will really understand what your point amounts to. Perhaps that level is not the first level, but it must be some finite level or other. On the other hand, instead of climbing to any of those systems, you can choose to accept contradictions of any level of complexity. Then, for some particular p , you  Ry will espouse  S8Sp  for any finite sequence of `S' and reject any of  #p ,  #Sp , etc.  Rb But then by the same token you will also accept  NSp ,  NSSp , etc, that is to say all corresponding instances of the principle of noncontradiction. Now, for all other formulae  R4  p  such that you do not accept  Sp , there is no valid ground on which you will base  R a rejection of  NSp . Thus, for every p  you will then accept  NSp . Which means that then you accept the principle of noncontradiction. Those are two legitimate, plausible options: either (1) only some lowlevel contradictions and no higherlevel contradiction, and no general principle of noncontradiction; or else (2) contradictions of every level plus the principle of noncontradiction. (The classicist's choice is the former, with admission of contradictions of 0 level only, i.e. no contradictions at all.) Even though I personally happen to think that the latter choice is better, more elegant, I nevertheless acknowledge the rationality and the motivation of da Costa's own choice.  R Anyway, are there extensions of CT which are Cmĩcompatible (in the technical  R sense of the term we are using)? There probably are. If to CT we add one among  Ro  2negation , DeMorgan-2 , DeMorgan-3 , DeMorgan-4 , the result can probably be shown  RZ to remain Cmĩcompatible. But then why has da Costa kept clear of them all, thus impoverishing his weak negation beyond necessity? The probable reason is that, if you  R, add e.g. DeMorgan-2 , then in a contradictorial theory wherein, for some particular  R constant , we have `UN', DeMorgan-2 will yield `N(NVNN)', i.e. a negation of an instance of excluded middle. And da Costa tries to confine (unavoidable) contradictions to atomic sentences, as far as possible. In some of his systems every nonatomic formula must be classical; that's not always the case as regards the modelizations of  R! his main systems of the C series, though; but even so, he clearly leans towards taking (most) nonatomic formulae to stand by classical standards " at least once disjunction has been entered " and thus to thinking that, whatever the behaviour of p " classical or not ", `p or notp' ought to behave classically: if admitted as true, its negation must be thoroughly rejected as purely and unmixedly false.  R& Not only is it possible to obtain Cmĩcompatible systems by strengthening CT with  R' at least one among double negation and the DeMorgan principles (except DeMorgan-1 ), but, what is more, apparently all those principles can be added together, at the same  R) time, " again with the exception of DeMorgan-1 " without the resulting system losing  Rj* its Cmĩcompatibility.j*o.,,55ԌWhile a study of da Costa's preferred semantical account of his systems through the method of twovalueed nontruthfunctional valuations invented by da Costa (and developed by I. Arruda, E. Alves and others) needn't concern us here, adapting the technique to the envisaged enrichments is rather straightforward. Thus double negation  R ( pDNNp ) requires that, for every valuation v, v(p)=v(NNp).  R Our examination of a different way of setting up systems Cm shows that da Costa's whole logical enterprise " as carried out in the construction of the C systems  R " must not be reduced to espousing BF ; that you can perfectly well reject BF while keeping many of the programmatic points implemented in the C systems; that your path and da Costa's can bifurcate without your being bound to part company with his  R orientation right from the start. Even without BF a lot of the significance and usefulness of [something close to] the C systems remains. Thus, our main result has been to clarify the true relations between Transitive Logic and da Costa's C systems, a clarification which was hard to attain within the  R framework of da Costa's original presentation of his systems. We now see that TL and  R the C systems are built up on an underlying common ground, system CT , i.e. classical logic plus: (a1) a weak nonclassical negation enjoying at least converse double negation and excluded middle; and (a2) a symbol for classicality (or classical wellbehavedness), which we have written as `#', enjoying the expected properties (hereditariness, Chrisippus, and the classicality of classicalityjudgments " or what, from a gradualistic  R( viewpoint [not da Costa's] can be termed the twovaluedness of twovaluedness R attributions, i.e. whether a situation is classical or not is a classical matter).  [p  p%References ă  R  [B1] Diderik Batens, Paraconsistent Extensional Propositional Logics ,  Logique et  R Analyse N 9091 (1980), pp. 195234.#  [C1] Newton C.A. da Costa, Calculs de pr)dicats pour les syst/mes formels  R6 inconsistants ,  Comptes Rendus de l'Acad)mie des Sciences de Paris , T. 257 (1963), pp. 37903792.#  R  [C2] Newton C.A. da Costa, On the Theory of Inconsistent Formal Systems ,  Notre  Rk Dame Journal of Formal Logic , XV/4 (1974), pp. 497510.#  R  [C3] Newton C.A. da Costa,  Ensaio sobre os fundamentos da l;gica . SMo Paulo: Hucitec, 1980.#  R!  [H1] Hubert Hubien, A New Basis for Classical Propositional Calculus , Logique et  R" Analyse 79 (1977), pp. 2257.#  Rb#  [M1] C. Mortensen, Every Quotient Algebra for C1 is Trivial ,  Notre Dame Journal of  RM$ Formal Logic , vol XXI (1980), pp. 694700.#  [P1] Lorenzo Pe9a, Contradictions and Paradigms: A Paraconsistent Approach , in  P&  Cultural Relativism and Philosophy: North and Latin American Perspec R' tives , ed, by Marcelo Dascal. Leiden & New York: E.J. Brill, 1991, pp. 2956.#  R(  [P2] Lorenzo Pe9a,  Rudimentos de l;gica matemtica . Madrid: Servicio de Publicaciones del CSIC, 1991. Pp. vi+324.#