TY - JOUR
T1 - A logic for the discovery of deterministic causal regularities
AU - Beirlaen, Mathieu
AU - Leuridan, Bert
AU - Van De Putte, Frederik
PY - 2018/1
Y1 - 2018/1
N2 - We present a logic, , for the discovery of deterministic causal regularities starting from empirical data. Our approach is inspired by Mackie's theory of causes as INUS-conditions, and implements a more recent adjustment to Mackie's theory according to which the left-hand side of causal regularities is required to be a minimal disjunction of minimal conjunctions. To derive such regularities from a given set of data, we make use of the adaptive logics framework. Our knowledge of deterministic causal regularities is, as Mackie noted, most often gappy or elliptical. The adaptive logics framework is well-suited to explicate both the internal and the external dynamics of the discovery of such gappy regularities. After presenting , we first discuss these forms of dynamics in more detail. Next, we consider some criticisms of the INUS-account and show how our approach avoids them, and we compare with the CNA algorithm that was recently proposed by Michael Baumgartner.
AB - We present a logic, , for the discovery of deterministic causal regularities starting from empirical data. Our approach is inspired by Mackie's theory of causes as INUS-conditions, and implements a more recent adjustment to Mackie's theory according to which the left-hand side of causal regularities is required to be a minimal disjunction of minimal conjunctions. To derive such regularities from a given set of data, we make use of the adaptive logics framework. Our knowledge of deterministic causal regularities is, as Mackie noted, most often gappy or elliptical. The adaptive logics framework is well-suited to explicate both the internal and the external dynamics of the discovery of such gappy regularities. After presenting , we first discuss these forms of dynamics in more detail. Next, we consider some criticisms of the INUS-account and show how our approach avoids them, and we compare with the CNA algorithm that was recently proposed by Michael Baumgartner.
UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=eur_pure&SrcAuth=WosAPI&KeyUT=WOS:000417084700017&DestLinkType=FullRecord&DestApp=WOS
U2 - 10.1007/s11229-016-1222-x
DO - 10.1007/s11229-016-1222-x
M3 - Article
SN - 0039-7857
VL - 195
SP - 367
EP - 399
JO - Synthese
JF - Synthese
IS - 1
ER -