Explaining explanation using new developments in logic and formal semantics. <https://sites.google.com/view/exlog2019/call-for-papers> Hyperintensionality, relevance, counterfactuals, grounding and truth-maker semantics.
Dates and place: 6-8 May 2019, UCLouvain, Louvain-la-Neuve, Belgium Invited speakers: Hannes Leitgeb, Francesca Poggiolesi, Friederike Moltmann, Raymundo Morado, Joke Meheus, Kit Fine, Michael Dunn Websites: Conference website: https://perso.uclouvain.be/peter.verdee/exlog2019 <https://www.google.com/url?q=https%3A%2F%2Fperso.uclouvain.be%2Fpeter.verdee%2Fexlog2019&sa=D&sntz=1&usg=AFQjCNHXE2M1ImpM7M_xKpBOZQKFfYECkg> Submission link: https://easychair.org/conferences/?conf=exlog2019 <https://www.google.com/url?q=https%3A%2F%2Feasychair.org%2Fconferences%2F%3Fconf%3Dexlog2019&sa=D&sntz=1&usg=AFQjCNHukUU4bKj1_L--PhH8c0IhHngaqQ> Submissions: All papers must be original. Abstracts are in English (recommended) or in French and between 500 and 1500 words. Young researchers (PhD students or recent PhDs) are particularly encouraged to submit an abstract. Important dates: Deadline for submissions: 15/3/2019 Notification of acceptance: 1/4/2019 Description: Ever since Hempel introduced his influential Deductive-Nomological model for explanation, it is clear that logic plays an important role in explanation. Nevertheless, one faces serious problems when trying to apply traditional logical ideas to explanation. A first problem is that explanation is arguably a hyperintensional notion, i.e. the relata of the explanation relation do not permit substitution of strict equivalents. It is not because A (possibly together with some other sentences) explains B and A and A’ are necessarily equivalent (or even logically equivalent) that we can say that A’ explains B. Neither can we say that A explains B’, for an arbitrary B’ necessarily equivalent to B. One of the reasons for this is that every sentence C that may provide insights is equivalent to an infinity of entirely opaque sentences (e.g. C is strictly equivalent to the disjunction of C and the negation of a very complicated necessity, e.g. an advanced theorem of mathematics – or even of logic). Another reason is that it seems that people successfully come up with explanations of necessary truths and use necessary truths as elements of explanations. Substitution of strict equivalents would make these cases of explanation trivial. Finally, it needs to be hyperintensional because the usual troubles with logical omniscience readily boil up as soon as substitution of equivalents is accepted. A second problem is caused by the very nature of classical logical implication (be it material, formal or even strict implication). This relation is obviously very different from the relation of explanation. Contradictions logically imply everything, but they explain very little. Moreover, unlike explanation, logical implication does not have any notion of usefulness, relevance or economy built in; if some principles imply something, one can always enlarge the set of principles with whatever irrelevant sentence, without breaking the relation of implication. This is not the case for explanation. One looks for a minimal explanation, or, maybe more accurately, an explanation of which all of the elements contribute in some way to explaining the explanandum. So traditional logical systems cannot readily be used for explaining explanation. However, recently, alternative formal tools have been developed that may on the contrary turn out to be very helpful. Examples are on the one hand (a) theories that aim to explicate hyperintensionality such as Neighborhood semantics, Transparent Intensional Logic, Leitgeb’s HYPE or Truthmaker Semantics, and on the other hand (b) non-classical logics that aim to solve problems raised by classical logic such as Relevance Logics, Connexive Logic, Paraconsistent Logics, or Mulivalued Logics. At the same time, (c) recent research has obtained considerable progress in developing formal models for important notions useful in understanding explanations, such as counterfactual conditionals (conditional logics, probabilistic semantics, Lewis semantics), degrees of belief (Bayesian nets), abduction (e.g. (Adaptive) logics of abduction), belief revision (AGM and many others), grounding (Fine’s and Poggiolesi’s proposals), aboutness (Yablo’s proposals), justification (justification logic, intuitionistic logic), and proof (provability logic, reverse mathematics, cut elimination, etc.). This conference aims to investigate what the state of the art in all of these domains may contribute to the notion of causal or non-causal explanation in empirical science, in mathematics, and even in philosophy. Local organizing committee: * Peter Verdée (UCLouvain) * Bruno Leclercq (ULiege) * Aleksandra Samonek (UCLouvain) * Mathieu Berteloot (UCLouvain) Scientific committee * Allo, Patrick, VUB * Batens, Diderik, UGent * Berto, Franz, St. Andrews and University of Amsterdam * De Brabanter, Philippe, ULB * Faroldi, Federico, UGent * Guay, Alexandre, UCLouvain * Heylen, Jan, KULeuven * Horsten, Leon, Bristol University * Lambert, Dominique, UNamur * Leuridan, Bert, UAntwerpen * Pence, Charles, UCLouvain and Louisiana State University * Restall, Greg, The University of Melbourne * Richard, Sébastien, ULB * Strasser, Christian, Ruhr Universität Bochum * Van De Putte, Frederik, UGent et University of Bayreuth * Van Kerkhove, Bart, VUB * Wansing, Heinrich, Ruhr Universität Bochum * Weber, Erik, UGent * Wenmackers, Sylvia, KULeuven Sponsors Fonds National de Recherche Scientifique FNRS Belgian Centre for Logic CNRL/NCNL Institut supérieur de philosophie de l'UCLouvain CEFISES, UCLouvain Related conference: Workshop on NON-CAUSAL EXPLANATIONS: LOGICAL, LINGUISTIC AND PHILOSOPHICAL PERSPECTIVES. Ghent University, 9-10 May 2019 http://www.lrr.ugent.be/noncausalexplanation/ <http://www.google.com/url?q=http%3A%2F%2Fwww.lrr.ugent.be%2Fnoncausalexplanation%2F&sa=D&sntz=1&usg=AFQjCNGhfmGpK_V5fikOHxx25WAJAzhahg> . Participation at both conferences is encouraged; we will avoid overlap. Contact: [email protected] -- Você está recebendo esta mensagem porque se inscreveu no grupo "LOGICA-L" dos Grupos do Google. Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie um e-mail para [email protected]. Para postar neste grupo, envie um e-mail para [email protected]. Visite este grupo em https://groups.google.com/a/dimap.ufrn.br/group/logica-l/. Para ver esta discussão na web, acesse https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/006201d4d5c6%249248ea40%24b6dabec0%24%40gmail.com.
