<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tajer, Diego</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Logic and Rational Requirements</style></title><secondary-title><style face="normal" font="default" size="100%">Organon F</style></secondary-title><translated-title><style face="normal" font="default" size="100%">Logic and Rational Requirements</style></translated-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Logic and rationality</style></keyword><keyword><style  face="normal" font="default" size="100%">normativity of logic</style></keyword><keyword><style  face="normal" font="default" size="100%">rational requirements</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.klemens.sav.sk/fiusav/doc/organon/2016/4/460-487.pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">460-487</style></pages><language><style face="normal" font="default" size="100%">English</style></language><abstract><style face="normal" font="default" size="100%">ABSTRACT: In this paper, I discuss the relation between logic and rationality. I develop (formally and conceptually) a rational requirement which can respond to the classic objections by Harman (1986). On the one hand, the requirement pays attention to the &lt;em&gt;relevance&lt;/em&gt; of the premises and the conclusion, which is formally expressed by the notion of weak relative closure. The requirement also takes care of the &lt;em&gt;complexity&lt;/em&gt; of the inferences. This notion of complexity is formally represented by a partially ordered scale of the difficulty of inferences, which is weaker than the notion of complexity as number of steps.</style></abstract><work-type><style face="normal" font="default" size="100%">State</style></work-type><custom2><style face="normal" font="default" size="100%">Articles</style></custom2><custom3><style face="normal" font="default" size="100%">460487</style></custom3></record></records></xml>