Search results for 'Combinatorial analysis' (try it on Scholar)

1000+ found
Sort by:
  1. Dale Jacquette (2006). Crossroads of Logic and Ontology: A Modal-Combinatorial Analysis of Why There is Something Rather Than Nothing. Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):17-46.score: 90.0
    Although it is frequently said that logic is a purely formal discipline lacking any content for special philosophical subdisciplines, I argue in this essay that the concepts of predication, and of the properties of objects presupposed by standard first-order logic are sufficient to address many of the traditional problems of ontology. The concept of an object's having a property is extended to provide an intensional definition of the existence of an object as the object's possessing a maximally consistent property combination, (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Jan von Plato (2010). Combinatorial Analysis of Proofs in Projective and Affine Geometry. Annals of Pure and Applied Logic 162 (2):144-161.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Rolf Niedermeier (2006). Invitation to Fixed-Parameter Algorithms. Oxford University Press.score: 84.0
    A fixed-parameter is an algorithm that provides an optimal solution to a combinatorial problem. This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Tarja Knuuttila & Andrea Loettgers (2011). Causal Isolation Robustness Analysis: The Combinatorial Strategy of Circadian Clock Research. Biology and Philosophy 26 (5):773-791.score: 78.0
    This paper distinguishes between causal isolation robustness analysis and independent determination robustness analysis and suggests that the triangulation of the results of different epistemic means or activities serves different functions in them. Circadian clock research is presented as a case of causal isolation robustness analysis: in this field researchers made use of the notion of robustness to isolate the assumed mechanism behind the circadian rhythm. However, in contrast to the earlier philosophical case studies on causal isolation robustness (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  5. Ivan Stojmenović (1987). Some Combinatorial and Algorithmic Problems in Many-Valued Logics. University of Novi Sad, Faculty of Science, Institute of Mathematics.score: 78.0
     
    My bibliography  
     
    Export citation  
  6. Jeff Coulter (1983). Contingent and a Priori Structures in Sequential Analysis: Introduction: On the Combinatorial Logic for Illocutionary Acts. Human Studies 6 (4):361 - 376.score: 72.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. R. Naumann (2003). Constraining the Combinatorial Patterns of Japanese V-V Compounds: An Analysis in Dynamic Event Semantics. Journal of Semantics 20 (3):275-296.score: 72.0
    In this article we investigate the argument structure of Japanese V–V compounds from the perspective of Dynamic Event Semantics (Naumann 2001). The argument structure of a verb is defined as a linearly ordered set of so‐called dynamic roles. Dynamic roles differ from thematic relations in characterizing participants in terms of sets of results that are brought about in the course of an event. The patterns of argument sharing found in Japanese V–V compounds are shown to derive from compatibility constraints on (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. Hans Niels Jahnke, Javier Echeverria, Andoni Ibarra & Thomas Mormann (1992). A Structuralist View of Lagrange's Algebraic Analysis and the German Combinatorial School. In Javier Echeverria, Andoni Ibarra & Thomas Mormann (eds.), The Space of Mathematics. De Gruyter.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. A. J. Wilkie (1986). Review: J. B. Paris, L. Pacholski, J. Wierzejewski, A. J. Wilkie, A Hierarchy of Cuts in Models of Arithmetic; George Mills, A Tree Analysis of Unprovable Combinatorial Statements; Jussi Ketonen, Robert Solovay, Rapidly Growing Ramsey Functions. [REVIEW] Journal of Symbolic Logic 51 (4):1062-1066.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. Mauro Di Nasso & Karel Hrbacek (2003). Combinatorial Principles in Nonstandard Analysis. Annals of Pure and Applied Logic 119 (1-3):265-293.score: 72.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Alexis Cartonnet (2011). Structuralisme et néoréalisme dans le champ des relations internationales. Le cas de Kenneth Waltz. Astérion 9.score: 60.0
    Cet article esquisse un rapprochement entre un courant de pensée politique, le néoréalisme, et une méthode en sciences humaines, le structuralisme. Ce courant et cette méthode ont suivi des trajectoires séparées, de l’après-guerre à la fin des années soixante-dix, jusqu’à ce que Kenneth Waltz croise ces deux problématiques. Après avoir défini respectivement réalisme et structuralisme, cet article établit leur connexion et tente d’éclairer les raisons pour lesquelles ce rapprochement n’avait pas été conduit jusqu’alors.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. Harry R. Lewis (1979). Unsolvable Classes of Quantificational Formulas. Addison-Wesley Pub. Co..score: 60.0
     
    My bibliography  
     
    Export citation  
  13. Donald O. Rudin (2001). Textbook of Programmed Science and Unified Philosophy: Beyond Socrates to a Theory of the World: A Universal Program Produces a World Theory. Core Books.score: 60.0
     
    My bibliography  
     
    Export citation  
  14. Jessica Carter (2010). Diagrams and Proofs in Analysis. International Studies in the Philosophy of Science 24 (1):1 – 14.score: 42.0
    This article discusses the role of diagrams in mathematical reasoning in the light of a case study in analysis. In the example presented certain combinatorial expressions were first found by using diagrams. In the published proofs the pictures were replaced by reasoning about permutation groups. This article argues that, even though the diagrams are not present in the published papers, they still play a role in the formulation of the proofs. It is shown that they play a role (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Jan Von Plato (2007). In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs. Bulletin of Symbolic Logic 13 (2):189-225.score: 42.0
    The Löwenheim-Skolem theorem was published in Skolem's long paper of 1920, with the first section dedicated to the theorem. The second section of the paper contains a proof-theoretical analysis of derivations in lattice theory. The main result, otherwise believed to have been established in the late 1980s, was a polynomial-time decision algorithm for these derivations. Skolem did not develop any notation for the representation of derivations, which makes the proofs of his results hard to follow. Such a formal notation (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. Jeremy Avigad & Richard Sommer (1997). A Model-Theoretic Approach to Ordinal Analysis. Bulletin of Symbolic Logic 3 (1):17-52.score: 42.0
    We describe a model-theoretic approach to ordinal analysis via the finite combinatorial notion of an α-large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in nonstandard instances, give rise to models of the theory being analyzed. This method is applied to obtain ordinal analyses of a number of interesting subsystems of first- and second-order arithmetic.
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  17. Douglas B. Kell (2012). Scientific Discovery as a Combinatorial Optimisation Problem: How Best to Navigate the Landscape of Possible Experiments? Bioessays 34 (3):236-244.score: 42.0
    A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a ‘landscape’ representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems ‘hard’, but as such these are to be seen as combinatorial optimisation problems that are best (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  18. Denis R. Hirschfeldt & Richard A. Shore (2007). Combinatorial Principles Weaker Than Ramsey's Theorem for Pairs. Journal of Symbolic Logic 72 (1):171-206.score: 42.0
    We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every infinite linear order has either an infinite descending sequence or an infinite ascending sequence, and CAC (Chain-AntiChain), which states that every infinite partial order has either an infinite chain or an infinite antichain. It is well-known that Ramsey's Theorem for (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  19. L. Gordeev (1989). Systems of Iterated Projective Ordinal Notations and Combinatorial Statements About Binary Labeled Trees. Archive for Mathematical Logic 29 (1):29-46.score: 42.0
    We introduce the appropriate iterated version of the system of ordinal notations from [G1] whose order type is the familiar Howard ordinal. As in [G1], our ordinal notations are partly inspired by the ideas from [P] where certain crucial properties of the traditional Munich' ordinal notations are isolated and used in the cut-elimination proofs. As compared to the corresponding “impredicative” Munich' ordinal notations (see e.g. [B1, B2, J, Sch1, Sch2, BSch]), our ordinal notations arearbitrary terms in the appropriate simple term (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  20. Ross P. Cameron (2008). Recombination and Intrinsicality. Ratio 21 (1):1–12.score: 30.0
    In this paper I argue that warrant for Lewis' principle of recombination presupposes warrant for a combinatorial analysis of intrinsicality, which in turn presupposes warrant for the principle of recombination. This, I claim, leads to a vicious circularity: warrant for neither doctrine can get off the ground.
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  21. Gideon Rosen (1993). A Problem for Fictionalism About Possible Worlds. Analysis 53 (2):71 - 81.score: 30.0
    Fictionalism about possible worlds is the view that talk about worlds in the analysis of modality is to be construed as ontologically innocent discourse about the content of a fiction. Versions of the view have been defended by D M Armstrong (in "A Combinatorial Theory of Possibility") and by myself (in "Modal Fictionalism', "Mind" 99, July 1990). The present note argues that fictionalist accounts of modality (both Armstrong's version and my own) fail to serve the fictionalists ontological purposes (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  22. Sheila E. Blumstein (1998). The Mapping From Acoustic Structure to the Phonetic Categories of Speech: The Invariance Problem. Behavioral and Brain Sciences 21 (2):260-260.score: 30.0
    This commentary focuses on the nature of combinatorial properties for speech and the locus equation. The presence of some overlap in locus equation space suggests that this higher order property may not be strictly invariant and may require other cues or properties for the perception of place of articulation. Moreover, combinatorial analysis in two-dimensional space and the resultant linearity appear to have a “special” status in the development of this theoretical framework. However, place of articulation is only (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  23. Harvey M. Sussman, David Fruchter, Jon Hilbert & Joseph Sirosh (1998). Linear Correlates in the Speech Signal: The Orderly Output Constraint. Behavioral and Brain Sciences 21 (2):241-259.score: 30.0
    Neuroethological investigations of mammalian and avian auditory systems have documented species-specific specializations for processing complex acoustic signals that could, if viewed in abstract terms, have an intriguing and striking relevance for human speech sound categorization and representation. Each species forms biologically relevant categories based on combinatorial analysis of information-bearing parameters within the complex input signal. This target article uses known neural models from the mustached bat and barn owl to develop, by analogy, a conceptualization of human processing of (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  24. Richard A. Griggs Richard, D. Platt Stephen, E. Newstead Sherri & L. Jackson (1998). Attentional Factors in a Disjunctive Reasoning Task. Thinking and Reasoning 4 (1):1 – 14.score: 30.0
    Girotto and Legrenzi's 1993 facilitation effect for their SARS version of Wason s THOG problem a disjunctive reasoning task was examined. The effect was not replicated when the standard THOG problem instructions were used in Experiments 1 and 2. However, in Experiment 3 when Girotto and Legrenzi's precise instructions were used, facilitation was observed. Experiment 4 further investigated the role of the type of instructions in the observed facilitation. The results suggest that such facilitation may result from attentional factors rather (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. Murat Aydede (1997). Language of Thought: The Connectionist Contribution. [REVIEW] Minds and Machines 7 (1):57-101.score: 24.0
    Fodor and Pylyshyn's critique of connectionism has posed a challenge to connectionists: Adequately explain such nomological regularities as systematicity and productivity without postulating a "language of thought" (LOT). Some connectionists like Smolensky took the challenge very seriously, and attempted to meet it by developing models that were supposed to be non-classical. At the core of these attempts lies the claim that connectionist models can provide a representational system with a combinatorial syntax and processes sensitive to syntactic structure. They are (...)
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  26. Scott A. Shalkowski (1994). The Ontological Ground of the Alethic Modality. Philosophical Review 103 (4):669-688.score: 24.0
    This paper is concerned with the wholly metaphysical question of whether necessity and possibility rest on nonmodal foundations—whether the truth conditions for modal statements are, in the final analysis, nonmodal. It is argued that Lewis’s modal realism is either arbitrary and stipulative or else it is circular. Even if there were Lewisean possible worlds, they could not provide the grounds for modality. D. M. Armstrong’s combinatorial approach to possibility suffers from similar defects. Since more traditional reductions to cognitive (...)
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  27. José Ferreirós (2011). On Arbitrary Sets and ZFC. Bulletin of Symbolic Logic 17 (3):361-393.score: 24.0
    Set theory deals with the most fundamental existence questions in mathematics—questions which affect other areas of mathematics, from the real numbers to structures of all kinds, but which are posed as dealing with the existence of sets. Especially noteworthy are principles establishing the existence of some infinite sets, the so-called “arbitrary sets.” This paper is devoted to an analysis of the motivating goal of studying arbitrary sets, usually referred to under the labels of quasi-combinatorialism or combinatorial maximality. After (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  28. Wolfgang Freitag (2009). Form and Philosophy: A Topology of Possibility and Representation. Synchron.score: 24.0
    Possibility and reference have been central topics in metaphysics and the philosophy of language in the past decades. Wolfgang Freitag’s Form and Philosophy provides a novel approach to these notions and their interrelations, based on the concept of form as the key modal concept: form is the possibility space of objects. In its historic dimension, the book analyses the role of form in Ludwig Wittgenstein’s Tractatus Logico-Philosophicus and Immanuel Kant’s Critique of Pure Reason. In its systematic dimension, the book offers (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  29. Jim Mackenzie (1990). Four Dialogue Systems. Studia Logica 49 (4):567 - 583.score: 24.0
    The paper describes four dialogue systems, developed in the tradition of Charles Hamblin. The first system provides an answer for Achilles in Lewis Carroll's parable, the second an analysis of the fallacy of begging the question, the third a non-psychologistic account of conversational implicature, and the fourth an analysis of equivocation and of objections to it. Each avoids combinatorial explosions, and is intended for real-time operation.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  30. Karola Stotz, 2001 and All That: A Tale of a Third Science.score: 24.0
    The paper describes the change from molecular genetics to postgenomic biology. It focuses on phenomena in the regulation of gene expression that provide a break with the central dogma, according to which sequence specificity for a gene product must be template derived. In its place we find what is called here ‘constitutive molecular epigenesis’. Its three classes of phenomena, which I call sequence ‘activation’, ‘selection’ and ‘creation’, are exemplified by processes such as transcriptional activation, alternative cis- and trans-splicing, and RNA (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  31. Beckett Sterner (2009). Object Spaces: An Organizing Strategy for Biological Theorizing. Biological Theory 4 (3):280-286.score: 24.0
    A classic analytic approach to biological phenomena seeks to refine definitions until classes are sufficiently homogenous to support prediction and explanation, but this approach founders on cases where a single process produces objects with similar forms but heterogeneous behaviors. I introduce object spaces as a tool to tackle this challenging diversity of biological objects in terms of causal processes with well-defined formal properties. Object spaces have three primary components: (1) a combinatorial biological process such as protein synthesis that generates (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. Alexander P. Kreuzer & Ulrich Kohlenbach (2012). Term Extraction and Ramsey's Theorem for Pairs. Journal of Symbolic Logic 77 (3):853-895.score: 24.0
    In this paper we study with proof-theoretic methods the function(al) s provably recursive relative to Ramsey's theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functional provably recursive from $RCA_0 + COH + \Pi _1^0 - CP$ are primitive recursive. This also provides a uniform method to extract bounds from proofs that use these principles. As a consequence we obtain a new proof of the fact that $WKL_0 + \Pi _1^0 - (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  33. Sergio F. Martínez (2001). Historia y Combinatoria de Las Representaciones Científicas. Comentarios a la Propuesta de Ibarra y Mormann (History and Combinations Scientific Representations. Comments to a Proposal by Ibarra and Mormann). Crítica 33 (99):75 - 95.score: 24.0
    En este texto se examina críticamente la teoría combinatoria de las representaciones científicas de Andoni Ibarra y Thomas Mormann. El núcleo de la crítica va dirigido a mostrar que una serie de estudios sobre la ciencia, que ellos mismos mencionan, sugiere que la clasificación en tipos de representaciones propuesta es problemática. Es más, esos mismos estudios muestran que por lo menos muchas representaciones tienen una dimensión histórica que parece imposible capturar por medio del tipo de formalismo propuesto. /// Ibarra and (...)
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  34. Enkhbold Nyamsuren & Niels A. Taatgen (2013). Set as an Instance of a Real-World Visual-Cognitive Task. Cognitive Science 37 (1):146-175.score: 24.0
    Complex problem solving is often an integration of perceptual processing and deliberate planning. But what balances these two processes, and how do novices differ from experts? We investigate the interplay between these two in the game of SET. This article investigates how people combine bottom-up visual processes and top-down planning to succeed in this game. Using combinatorial and mixed-effect regression analysis of eye-movement protocols and a cognitive model of a human player, we show that SET players deploy both (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  35. Philipp Gerhardy (2008). Proof Mining in Topological Dynamics. Notre Dame Journal of Formal Logic 49 (4):431-446.score: 24.0
    A famous theorem by van der Waerden states the following: Given any finite coloring of the integers, one color contains arbitrarily long arithmetic progressions. Equivalently, for every q,k, there is an N = N(q,k) such that for every q-coloring of an interval of length N one color contains a progression of length k. An obvious question is what is the growth rate of N = N(q,k). Some proofs, like van der Waerden's combinatorial argument, answer this question directly, while the (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  36. M. Gerner (2012). Predicate-Induced Permutation Groups. Journal of Semantics 29 (1):109-144.score: 24.0
    Natural languages abound in combinatorial phenomena that are related to the predicate of the sentence and its ability to permute noun phrase arguments. After compiling several illustrative phenomena of natural languages, I propose a novel analysis in terms of permutation groups, a concept borrowed from mathematical combinatorics that is ubiquitous in applied sciences. I show that each natural language predicate of degree n (n natural number) can be associated with two permutation groups of degree n. The first group (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  37. Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson & Dorothea Wagner, Algorithm Engineering (Dagstuhl Seminar 13391).score: 24.0
    This report documents the program and the outcomes of Dagstuhl Seminar 13391 "Algorithm Engineering". The algorithm engineering approach consists of a cycle of algorithm design, analysis, implementation, and experimental evaluation, with the aim of bridging the gap between theory and practice in the area of algorithms. This cycle of phases is driven by falsifiable hypotheses validated by experiments. Moreover, real-world instances often have direct impact on this cycle since they often expose modeling and analysis shortcomings. Algorithm engineering touches (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  38. William R. Stirton (2012). How to Assign Ordinal Numbers to Combinatory Terms with Polymorphic Types. Archive for Mathematical Logic 51 (5-6):475-501.score: 24.0
    The article investigates a system of polymorphically typed combinatory logic which is equivalent to Gödel’s T. A notion of (strong) reduction is defined over terms of this system and it is proved that the class of well-formed terms is closed under both bracket abstraction and reduction. The main new result is that the number of contractions needed to reduce a term to normal form is computed by an ε 0-recursive function. The ordinal assignments used to obtain this result are also (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  39. Jeremy Avigad & Henry Towsner, Metastability in the Furstenberg-Zimmer Tower.score: 24.0
    According to the Furstenberg-Zimmer structure theorem, every measure-preserving system has a maximal distal factor, and is weak mixing relative to that factor. Furstenberg and Katznelson used this structural analysis of measure-preserving systems to provide a perspicuous proof of Szemer\'edi's theorem. Beleznay and Foreman showed that, in general, the transfinite construction of the maximal distal factor of a separable measure-preserving system can extend arbitrarily far into the countable ordinals. Here we show that the Furstenberg-Katznelson proof does not require the full (...)
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. Alfredo Pereira Jr (2007). Uma Reflexão a Respeito da Evolução Humana E a Natureza da Linguagem. Abstracta 3 (2):138-161.score: 24.0
    In this paper I discuss scientific and philosophical issues related to the interdisciplinary area of Neurolinguistics, focusing on the origin and nature of human language. What kind of evolutionary process leads to the emergence of language? I propose that this process began with the adoption of bipedalism, triggering the co-evolution of new brain structures and forms of social organization. This process created a context that favoured the emergence of articulated vocalization using a combinatorial linguistic system. The identification of sufficient (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  41. Tim Button (2013). Truth by Analysis: Games, Names, and Philosophy By Colin McGinn. [REVIEW] Analysis 73 (3):577-580.score: 21.0
    In Truth by Analysis (2012), Colin McGinn aims to breathe new life into conceptual analysis. Sadly, he fails to defend conceptual analysis, either in principle or by example.
    Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  42. Todor D. Todorov & Hans Vernaeve (2008). Full Algebra of Generalized Functions and Non-Standard Asymptotic Analysis. Logic and Analysis 1 (3-4):205-234.score: 21.0
    We construct an algebra of generalized functions endowed with a canonical embedding of the space of Schwartz distributions.We offer a solution to the problem of multiplication of Schwartz distributions similar to but different from Colombeau’s solution.We show that the set of scalars of our algebra is an algebraically closed field unlike its counterpart in Colombeau theory, which is a ring with zero divisors. We prove a Hahn–Banach extension principle which does not hold in Colombeau theory. We establish a connection between (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Gustav Tinghög (2012). Discounting, Preferences, and Paternalism in Cost-Effectiveness Analysis. Health Care Analysis 20 (3):297-318.score: 21.0
    When assessing the cost effectiveness of health care programmes, health economists typically presume that distant events should be given less weight than present events. This article examines the moral reasonableness of arguments advanced for positive discounting in cost-effectiveness analysis both from an intergenerational and an intrapersonal perspective and assesses if arguments are equally applicable to health and monetary outcomes. The article concludes that behavioral effects related to time preferences give little or no reason for why society at large should (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  44. Nuala Kenny & Christine Joffres (2008). An Ethical Analysis of International Health Priority-Setting. Health Care Analysis 16 (2):145-160.score: 21.0
    Health care systems throughout the developed world face ‘crises’ of quality, financing and sustainability. These pressures have led governments to look for more efficient and equitable ways to allocate public resources. Prioritisation of health care services for public funding has been one of the strategies used by decision makers to reconcile growing health care demands with limited resources. Priority setting at the macro level has yet to demonstrate real successes. This paper describes international approaches to explicit prioritisation at the macro-governmental (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  45. Dawn M. Phillips (2007). Complete Analysis and Clarificatory Analysis in Wittgenstein's Tractatus. In Michael Beaney (ed.), The Analytic Turn: Analysis in Early Analytic Philosophy and Phenomenology. Routledge. 164.score: 21.0
    I examine the relationship between complete analysis and clarificatory analysis and explain why Wittgenstein thought he required both in his account of how to solve the problems of philosophy. I first describe Wittgenstein’s view of how philosophical confusions arise, by explaining how it is possible to misunderstand the logic of everyday language. I argue that any method of logical analysis in the Tractatus will inevitably be circular, but explain why this does not threaten the prospect of solving (...)
     
    My bibliography  
     
    Export citation  
  46. David J. Chalmers & Frank Jackson (2001). Conceptual Analysis and Reductive Explanation. Philosophical Review 110 (3):315-61.score: 18.0
    Is conceptual analysis required for reductive explanation? If there is no a priori entailment from microphysical truths to phenomenal truths, does reductive explanation of the phenomenal fail? We say yes (Chalmers 1996; Jackson 1994, 1998). Ned Block and Robert Stalnaker say no (Block and Stalnaker 1999).
    Direct download (15 more)  
     
    My bibliography  
     
    Export citation  
  47. Stephen Laurence & Eric Margolis (2003). Concepts and Conceptual Analysis. Philosophy and Phenomenological Research 67 (2):253-282.score: 18.0
    Conceptual analysis is undergoing a revival in philosophy, and much of the credit goes to Frank Jackson. Jackson argues that conceptual analysis is needed as an integral component of so-called serious metaphysics and that it also does explanatory work in accounting for such phenomena as categorization, meaning change, communication, and linguistic understanding. He even goes so far as to argue that opponents of concep- tual analysis are implicitly committed to it in practice. We show that he is (...)
    Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  48. Laura Schroeter (2004). The Limits of Conceptual Analysis. Pacific Philosophical Quarterly 85 (4):425-453.score: 18.0
    It would be nice if good old a priori conceptual analysis were possible. For many years conceptual analysis was out of fashion, in large part because of the excessive ambitions of verificationist theories of meaning._ _However, those days are over._ _A priori conceptual analysis is once again part of the philosophical mainstream._ _This renewed popularity, moreover, is well-founded. Modern philosophical analysts have exploited developments in philosophical semantics to formulate analyses which avoid the counterintuitive consequences of verificationism, while (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  49. David Braddon-Mitchell & Robert Nola (eds.) (2009). Conceptual Analysis and Philosophical Naturalism. Mit Press.score: 18.0
    A new program of philosophical analysis that reconciles a certain account of analysis with philosophical naturalism is applied to a range of philosophical ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  50. Greg Bamford (1991). Design, Science and Conceptual Analysis. In Jim Plume (ed.), Architectural Science and Design in Harmony: Proceedings of the joint ANZAScA / ADTRA conference, Sydney, 10-12 July, 1990. School of Architecture, University of NSW.score: 18.0
    Philosophers expend considerable effort on the analysis of concepts, but the value of such work is not widely appreciated. This paper principally analyses some arguments, beliefs, and presuppositions about the nature of design and the relations between design and science common in the literature to illustrate this point, and to contribute to the foundations of design theory.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000