Results for 'parameterization'

135 found
Order:
  1.  10
    Models, Parameterization, and Software: Epistemic Opacity in Computational Chemistry.Frédéric Wieber & Alexandre Hocquet - 2020 - Perspectives on Science 28 (5):610-629.
    Computational chemistry grew in a new era of “desktop modeling,” which coincided with a growing demand for modeling software, especially from the pharmaceutical industry. Parameterization of models in computational chemistry is an arduous enterprise, and we argue that this activity leads, in this specific context, to tensions among scientists regarding the epistemic opacity transparency of parameterized methods and the software implementing them. We relate one flame war from the Computational Chemistry mailing List in order to assess in detail the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  14
    Parameterized Partition Relations on the Real Numbers.Joan Bagaria & Carlos A. Di Prisco - 2009 - Archive for Mathematical Logic 48 (2):201-226.
    We consider several kinds of partition relations on the set ${\mathbb{R}}$ of real numbers and its powers, as well as their parameterizations with the set ${[\mathbb{N}]^{\mathbb{N}}}$ of all infinite sets of natural numbers, and show that they hold in some models of set theory. The proofs use generic absoluteness, that is, absoluteness under the required forcing extensions. We show that Solovay models are absolute under those forcing extensions, which yields, for instance, that in these models for every well ordered partition (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  18
    Parameterized Complexity of Theory of Mind Reasoning in Dynamic Epistemic Logic.Iris van de Pol, Iris van Rooij & Jakub Szymanik - 2018 - Journal of Logic, Language and Information 27 (3):255-294.
    Theory of mind refers to the human capacity for reasoning about others’ mental states based on observations of their actions and unfolding events. This type of reasoning is notorious in the cognitive science literature for its presumed computational intractability. A possible reason could be that it may involve higher-order thinking. To investigate this we formalize theory of mind reasoning as updating of beliefs about beliefs using dynamic epistemic logic, as this formalism allows to parameterize ‘order of thinking.’ We prove that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  22
    Parameterizing Mental Model Ascription Across Intelligent Agents.Marjorie McShane - 2014 - Interaction Studies 15 (3):404-425.
    Mental model ascription – also called mindreading – is the process of inferring the mental states of others, which happens as a matter of course in social interactions. But although ubiquitous, mindreading is presumably a highly variable process: people mindread to different extents and with _different results._ We hypothesize that human mindreading ability relies on a large number of personal and contextual features: the inherent abilities of specific individuals, their current physical and mental states, their knowledge of the domain of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  5.  11
    Parameterizing Mental Model Ascription Across Intelligent Agents.Marjorie McShane - 2014 - Interaction Studies. Social Behaviour and Communication in Biological and Artificial Systemsinteraction Studies / Social Behaviour and Communication in Biological and Artificial Systemsinteraction Studies 15 (3):404-425.
    Mental model ascription – also called mindreading – is the process of inferring the mental states of others, which happens as a matter of course in social interactions. But although ubiquitous, mindreading is presumably a highly variable process: people mindread to different extents and with different results. We hypothesize that human mindreading ability relies on a large number of personal and contextual features: the inherent abilities of specific individuals, their current physical and mental states, their knowledge of the domain of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  29
    Parameterize!: Notes on Mathematical Modeling for Sociology.Harrison C. White - 2000 - Sociological Theory 18 (3):505-509.
    Radius is parameter to circles. Mathematical modeling contributes best to sociological theory through parameterizing. Parameters form a seam linking quantitative and qualitative panels of theory. All social construction comes through feedback, and modeling its outcomes requires use of parameters.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  18
    Parameterized Special Theory of Relativity (PSTR).Florentin Smarandache - 2012 - Apeiron: Studies in Infinite Nature 19 (2):115-122.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  13
    A Parameterized Probabilistic Model of Network Evolution for Supervised Link Prediction.Hisashi Kashima & Naoki Abe - 2007 - Transactions of the Japanese Society for Artificial Intelligence 22 (2):209-217.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  8
    The Parameterized Complexity of Maximality and Minimality Problems.Yijia Chen & Jörg Flum - 2008 - Annals of Pure and Applied Logic 151 (1):22-61.
    Many parameterized problems ask, given an instance and a natural number k as parameter, whether there is a solution of size k. We analyze the relationship between the complexity of such a problem and the corresponding maximality problem asking for a solution of size k maximal with respect to set inclusion. As our results show, many maximality problems increase the parameterized complexity, while “in terms of the W-hierarchy” minimality problems do not increase the complexity. We also address the corresponding construction, (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  32
    Guidelines for Dynamics‐Based Parameterization of One‐Dimensional Cellular Automata Rule Spaces.Gina Maira Barbosa de Oliveira, Pedro P. B. de Oliveira & Nizam Omar - 2000 - Complexity 6 (2):63-71.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  37
    Perspectives and Parameterizations Commentary on Benjamin Kerr and Peter Godfrey-Smith's ``Individualist and Multi-Level Perspectives on Selection in Structured Populations''.Elliott Sober & David Sloan Wilson - 2002 - Biology and Philosophy 17 (4):529-537.
    We have two main objections to Kerr and Godfrey-Smith's (2002) meticulous analysis. First, they misunderstand the position we took in Unto Others – we do not claim that individual-level statements about the evolution of altruism are always unexplanatory and always fail to capture causal relationships. Second, Kerr and Godfrey-Smith characterize the individual and the multi-level perspectives in terms of different sets of parameters. In particular, they do not allow the multi-level perspective to use the individual fitness parameters i and i. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  10
    Parameterized Counting Problems.Catherine McCartin - 2006 - Annals of Pure and Applied Logic 138 (1):147-182.
    Parameterized complexity has, so far, been largely confined to consideration of computational problems as decision or search problems. However, it is becoming evident that the parameterized point of view can lead to new insight into counting problems. The goal of this article is to introduce a formal framework in which one may consider parameterized counting problems.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  13.  22
    Dimension Theory and Parameterized Normalization for D-Semianalytic Sets Over Non-Archimedean Fields.Y. Firat Çelikler - 2005 - Journal of Symbolic Logic 70 (2):593 - 618.
    We develop a dimension theory for D-semianalytic sets over an arbitrary non-Archimedean complete field. Our main results are the equivalence of several notions of dimension and a theorem on additivity of dimensions of projections and fibers in characteristic 0. We also prove a parameterized version of normalization for D-semianalytic sets.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  20
    Parameterizing and Scoring Mixed Ancestral Graphs.Thomas Richardson & Peter Spirtes - unknown
    Thomas Richardson and Peter Spirtes. Parameterizing and Scoring Mixed Ancestral Graphs.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  32
    On the Parameterized Complexity of Short Computation and Factorization.Liming Cai, Jianer Chen, Rodney G. Downey & Michael R. Fellows - 1997 - Archive for Mathematical Logic 36 (4-5):321-337.
    . A completeness theory for parameterized computational complexity has been studied in a series of recent papers, and has been shown to have many applications in diverse problem domains including familiar graph-theoretic problems, VLSI layout, games, computational biology, cryptography, and computational learning [ADF,BDHW,BFH, DEF,DF1-7,FHW,FK]. We here study the parameterized complexity of two kinds of problems: problems concerning parameterized computations of Turing machines, such as determining whether a nondeterministic machine can reach an accept state in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  3
    An Analytic and Cognitive Parameterization of Coherence Relations.Max Louwerse - 2002 - Cognitive Linguistics 12 (3).
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  17.  1
    The Everyday World of Simulation Modeling: The Development of Parameterizations in Meteorology.Mikaela Sundberg - 2009 - Science, Technology, and Human Values 34 (2):162-181.
    This article explores the practice of simulation modeling by investigating how parameterizations are constructed and integrated into existing frameworks. Parameterizations are simplified process descriptions adapted for simulation models. On the basis of a study of meteorological research, the article presents predictive and representative construction as two different ways of developing parameterizations and the trade-offs involved in this work. Because the overall aim in predictive construction is to improve weather forecasts, the most practical solutions are chosen over the best theoretical solutions. (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  18.  5
    Sparse Parameterized Problems.Marco Cesati & Michael R. Fellows - 1996 - Annals of Pure and Applied Logic 82 (1):1-15.
    Sparse languages play an important role in classical structural complexity theory. In this paper we introduce a natural definition of sparse problems for parameterized complexity theory. We prove an analog of Mahaney's theorem: there is no sparse parameterized problem which is hard for the tth level of the W hierarchy, unless the W hierarchy itself collapses up to level t. The main result is proved for the most general form of parametric many:1 reducibility, where the parameter functions are not assumed (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  19.  12
    Advice Classes of Parameterized Tractability.Liming Cai, Jianer Chen, Rodney G. Downey & Michael R. Fellows - 1997 - Annals of Pure and Applied Logic 84 (1):119-138.
    Many natural computational problems have input consisting of two or more parts, one of which may be considered a parameter. For example, there are many problems for which the input consists of a graph and a positive integer. A number of results are presented concerning parameterized problems that can be solved in complexity classes below P, given a single word of advice for each parameter value. Different ways in which the word of advice can be employed are considered, and it (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20. REVIEWS-Parameterized Complexity Theory.J. Flum, M. Grohe & Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2).
  21.  31
    Conceiving Processes in Atmospheric Models—General Equations, Subscale Parameterizations, and 'Superparameterizations'.Gabriele Gramelsberger - 2010 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 41 (3):233-241.
  22. Parameterized.R. G. Downey & M. R. Fellows - forthcoming - Complexity.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  23.  56
    A Parameterization of RNA Sequence Space.Erik Schultes, Peter T. Hraber & Thomas H. LaBean - 1999 - Complexity 4 (4):61-71.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  4
    Conceiving Processes in Atmospheric Models—General Equations, Subscale Parameterizations, and ‘Superparameterizations’.Gabriele Gramelsberger - 2010 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 41 (3):233-241.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  25.  8
    Avoiding Haag’s Theorem with Parameterized Quantum Field Theory.Ed Seidewitz - 2017 - Foundations of Physics 47 (3):355-374.
    Under the normal assumptions of quantum field theory, Haag’s theorem states that any field unitarily equivalent to a free field must itself be a free field. Unfortunately, the derivation of the Dyson series perturbation expansion relies on the use of the interaction picture, in which the interacting field is unitarily equivalent to the free field but must still account for interactions. Thus, the traditional perturbative derivation of the scattering matrix in quantum field theory is mathematically ill defined. Nevertheless, perturbative quantum (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  31
    Quasivarieties of Logic, Regularity Conditions and Parameterized Algebraization.G. D. Barbour & J. G. Raftery - 2003 - Studia Logica 74 (1-2):99 - 152.
    Relatively congruence regular quasivarieties and quasivarieties of logic have noticeable similarities. The paper provides a unifying framework for them which extends the Blok-Pigozzi theory of elementarily algebraizable (and protoalgebraic) deductive systems. In this extension there are two parameters: a set of terms and a variable. When the former is empty or consists of theorems, the Blok-Pigozzi theory is recovered, and the variable is redundant. On the other hand, a class of membership logics is obtained when the variable is the only (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  4
    On the Parameterized Complexity of Non-Monotonic Logics.Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas & Heribert Vollmer - 2015 - Archive for Mathematical Logic 54 (5-6):685-710.
    We investigate the application of Courcelle’s theorem and the logspace version of Elberfeld et al. in the context of non-monotonic reasoning. Here we formalize the implication problem for propositional sets of formulas, the extension existence problem for default logic, the expansion existence problem for autoepistemic logic, the circumscriptive inference problem, as well as the abduction problem in monadic second order logic and thereby obtain fixed-parameter time and space efficient algorithms for these problems. On the other hand, we exhibit, for each (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  8
    Quasivarieties of Logic, Regularity Conditions and Parameterized Algebraization.G. Barbour & J. Raftery - 2003 - Studia Logica 74 (1):99-152.
    Relatively congruence regular quasivarieties and quasivarieties of logic have noticeable similarities. The paper provides a unifying framework for them which extends the Blok-Pigozzi theory of elementarily algebraizable deductive systems. In this extension there are two parameters: a set of terms and a variable. When the former is empty or consists of theorems, the Blok-Pigozzi theory is recovered, and the variable is redundant. On the other hand, a class of 'membership logics' is obtained when the variable is the only element of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  29. Interlingual Machine Translation A Parameterized Approach.Bonnie J. Dorr - 1993 - Artificial Intelligence 63 (1-2):429-492.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  29
    Computation Models for Parameterized Complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
  31.  7
    Fixed-Parameter Decidability: Extending Parameterized Complexity Analysis.Jouke Witteveen & Leen Torenvliet - 2016 - Mathematical Logic Quarterly 62 (6):596-607.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  32.  12
    Trends in Parameterization, Economics and Host Behaviour in Influenza Pandemic Modelling: A Review and Reporting Protocol.L. R. Carrasco, M. Jit, M. I. Chen, V. J. Lee, G. J. Milne & A. R. Cook - unknown
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  5
    An o-Minimal Structure Without Mild Parameterization.Margaret Em Thomas - 2011 - Annals of Pure and Applied Logic 162 (6):409-418.
    We prove, by explicit construction, that not all sets definable in polynomially bounded o-minimal structures have mild parameterization. Our methods do not depend on the bounds particular to the definition of mildness and therefore our construction is also valid for a generalized form of parameterization, which we call G-mild. Moreover, we present a cell decomposition result for certain o-minimal structures which may be of independent interest. This allows us to show how our construction can produce polynomially bounded, model (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  34.  3
    Tolerant Values and Practices in India: Amartya Sen’s ‘Positional Observation’ and Parameterization of Ethical Rules.Santosh Saha - 2015 - Tattva - Journal of Philosophy 7 (1):51-84.
    In explaining the reasons for sustained existence of tolerance in Indian philosophical mind and continuation of tolerant practices in socio-political life, Amartya Sen argues that tolerance is inherently a social enterprise, which may appear as contingent, but for all intents and purposes is persistent. Basing his thesis that is opposed to Cartesian dualism, which makes a distinction between mind and body, Sen submits that Indian system of universalizing perception finds a subtle form of connection between mind and body. He expands (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis.Iris van Rooij, Mark Blokpoel, Johan Kwisthout & Todd Wareham - 2019 - Cambridge University Press.
    Intractability is a growing concern across the cognitive sciences: while many models of cognition can describe and predict human behavior in the lab, it remains unclear how these models can scale to situations of real-world complexity. Cognition and Intractability is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science. Covering both classical and parameterized complexity analysis, it introduces the mathematical concepts and proof techniques that can be used (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  15
    Hardness Measures for Maze Problems Parameterized by Obstacle Ratio and Performance Analysis of Real-Time Search Algorithms.Masataka Mizusawa & Masahito Kurihara - 2006 - Transactions of the Japanese Society for Artificial Intelligence 21:266-275.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  17
    Review: R. G. Downey, M. R. Fellows, Parameterized Complexity. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
  38.  35
    R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer, New York, Berlin, and Heidelberg, 1999, Xv + 533 Pp. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
  39.  8
    Specialized Knowledge Representation and the Parameterization of Context.Pamela Faber & Pilar León-Araúz - 2016 - Frontiers in Psychology 7.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  40. J. Flum and M. Grohe, Parameterized Complexity Theory.T. Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2).
  41.  14
    Corrigendum to “Advice Classes of Parameterized Tractability” [Ann. Pure Appl. Logic 84 119–138].Liming Cai, Jainer Chen, Rod Downey & Mike Fellows - 2018 - Annals of Pure and Applied Logic 169 (5):463-465.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42.  44
    Mildness and the Density of Rational Points on Certain Transcendental Curves.G. O. Jones, D. J. Miller & M. E. M. Thomas - 2011 - Notre Dame Journal of Formal Logic 52 (1):67-74.
    We use a result due to Rolin, Speissegger, and Wilkie to show that definable sets in certain o-minimal structures admit definable parameterizations by mild maps. We then use this parameterization to prove a result on the density of rational points on curves defined by restricted Pfaffian functions.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  87
    Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
    In 1979, H. Lewis shows that the computational complexity of the Boolean satisfiability problem dichotomizes, depending on the Boolean operations available to formulate instances: intractable (NP-complete) if negation of implication is definable, and tractable (in P) otherwise [21]. Recently, an investigation in the same spirit has been extended to nonclassical propositional logics, modal logics in particular [2, 3]. In this note, we pursue this line in the realm of many-valued propositional logics, and obtain complexity classifications for the parameterized satisfiability problem (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  44.  27
    Index Sets and Parametric Reductions.Rod G. Downey & Michael R. Fellows - 2001 - Archive for Mathematical Logic 40 (5):329-348.
    We investigate the index sets associated with the degree structures of computable sets under the parameterized reducibilities introduced by the authors. We solve a question of Peter Cholakand the first author by proving the fundamental index sets associated with a computable set A, {e : W e ≤ q u A} for q∈ {m, T} are Σ4 0 complete. We also show hat FPT(≤ q n ), that is {e : W e computable and ≡ q n ?}, is Σ4 (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  45. Modularity, Development and "Theory of Mind".Alan M. Leslie & Brian J. Scholl - 1999 - Mind and Language 14 (1):131-153.
    Psychologists and philosophers have recently been exploring whether the mechanisms which underlie the acquisition of ‘theory of mind’ (ToM) are best charac- terized as cognitive modules or as developing theories. In this paper, we attempt to clarify what a modular account of ToM entails, and why it is an attractive type of explanation. Intuitions and arguments in this debate often turn on the role of develop- ment: traditional research on ToM focuses on various developmental sequences, whereas cognitive modules are thought (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   101 citations  
  46. The Violation of Bell Inequalities in the Macroworld.Diederik Aerts, Sven Aerts, Jan Broekaert & Liane Gabora - 2000 - Foundations of Physics 30 (9):1387-1414.
    We show that Bell inequalities can be violated in the macroscopic world. The macroworld violation is illustrated using an example involving connected vessels of water. We show that whether the violation of inequalities occurs in the microworld or the macroworld, it is the identification of nonidentical events that plays a crucial role. Specifically, we prove that if nonidentical events are consistently differentiated, Bell-type Pitowsky inequalities are no longer violated, even for Bohm's example of two entangled spin 1/2 quantum particles. We (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  47.  31
    The Computational and Neural Basis of Cognitive Control: Charted Territory and New Frontiers.Matthew M. Botvinick - 2014 - Cognitive Science 38 (6):1249-1285.
    Cognitive control has long been one of the most active areas of computational modeling work in cognitive science. The focus on computational models as a medium for specifying and developing theory predates the PDP books, and cognitive control was not one of the areas on which they focused. However, the framework they provided has injected work on cognitive control with new energy and new ideas. On the occasion of the books' anniversary, we review computational modeling in the study of cognitive (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  48.  23
    Modelling Competing Legal Arguments Using Bayesian Model Comparison and Averaging.Martin Neil, Norman Fenton, David Lagnado & Richard David Gill - 2019 - Artificial Intelligence and Law 27 (4):403-430.
    Bayesian models of legal arguments generally aim to produce a single integrated model, combining each of the legal arguments under consideration. This combined approach implicitly assumes that variables and their relationships can be represented without any contradiction or misalignment, and in a way that makes sense with respect to the competing argument narratives. This paper describes a novel approach to compare and ‘average’ Bayesian models of legal arguments that have been built independently and with no attempt to make them consistent (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  49. Dynamic Update with Probabilities.Johan van Benthem, Jelle Gerbrandy & Barteld Kooi - 2009 - Studia Logica 93 (1):67 - 96.
    Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  50.  20
    What is Macroeconomic Causality?Tobias Henschen - 2018 - Journal of Economic Methodology 25 (1):1-20.
    The paper aims to develop an adequate account of macroeconomic causality. It discusses the definition that is central to Woodward’s interventionist account and the definitions that can be extracted from Hoover’s remarks on privileged parameterization and from the potential outcome approach that Angrist and Kuersteiner have introduced into macroeconomics more recently. The definition to be defended can be regarded as the gist that is common to all three definitions when they are relieved of overly restrictive conditions. It says that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
1 — 50 / 135