Results for 'Combinatorial analysis'

1000+ found
Order:
  1.  7
    Combinatorial Analysis of Proofs in Projective and Affine Geometry.Jan von Plato - 2010 - Annals of Pure and Applied Logic 162 (2):144-161.
    The axioms of projective and affine plane geometry are turned into rules of proof by which formal derivations are constructed. The rules act only on atomic formulas. It is shown that proof search for the derivability of atomic cases from atomic assumptions by these rules terminates . This decision method is based on the central result of the combinatorial analysis of derivations by the geometric rules: The geometric objects that occur in derivations by the rules can be restricted (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  2.  35
    Crossroads of Logic and Ontology: A Modal-Combinatorial Analysis of Why There is Something Rather Than Nothing.Dale Jacquette - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):17-46.
    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)  
     
    Export citation  
     
    My bibliography  
  3.  2
    Combinatorial Principles in Nonstandard Analysis.Mauro Di Nasso & Karel Hrbacek - 2003 - Annals of Pure and Applied Logic 119 (1-3):265-293.
    We study combinatorial principles related to the isomorphism property and the special model axiom in nonstandard analysis.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  4.  14
    Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - forthcoming - Studia Logica.
    The present volume is an introduction to the use of tools from computability theory and reverse mathematics to study combinatorial principles, in particular Ramsey's theorem and special cases such as Ramsey's theorem for pairs. It would serve as an excellent textbook for graduate students who have completed a course on computability theory.
    Direct download  
     
    Export citation  
     
    My bibliography  
  5.  37
    Causal Isolation Robustness Analysis: The Combinatorial Strategy of Circadian Clock Research.Tarja Knuuttila & Andrea Loettgers - 2011 - Biology and Philosophy 26 (5):773-791.
    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)  
     
    Export citation  
     
    My bibliography   5 citations  
  6.  12
    Contingent and a Priori Structures in Sequential Analysis: Introduction: On the Combinatorial Logic for Illocutionary Acts.Jeff Coulter - 1983 - Human Studies 6 (4):361 - 376.
    Direct download  
     
    Export citation  
     
    My bibliography  
  7.  7
    Constraining the Combinatorial Patterns of Japanese V-V Compounds: An Analysis in Dynamic Event Semantics.R. Naumann - 2003 - Journal of Semantics 20 (3):275-296.
    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 (3 more)  
     
    Export citation  
     
    My bibliography  
  8.  4
    A Structuralist View of Lagrange's Algebraic Analysis and the German Combinatorial School.Hans Niels Jahnke - 1992 - In Javier Echeverria, Andoni Ibarra & Thomas Mormann (eds.), The Space of Mathematics. De Gruyter.
    Direct download  
     
    Export citation  
     
    My bibliography  
  9.  1
    Paris J. B.. A Hierarchy of Cuts in Models of Arithmetic. Model Theory of Algebra and Arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1–7, 1979, Edited by Pacholski L., Wierzejewski J., and Wilkie A. J., Lecture Notes in Mathematics, Vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, Pp. 312–337.Mills George. A Tree Analysis of Unprovable Combinatorial Statements. Model Theory of Algebra and Arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1–7, 1979, Pp. 248–311.Ketonen Jussi and Solovay Robert. Rapidly Growing Ramsey Functions. Annals of Mathematics, Ser. 2 Vol. 113 , Pp. 267–314. [REVIEW]A. J. Wilkie - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.
  10.  3
    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]A. J. Wilkie - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.
  11. Communication Analysis Focusing Negative Utterances in Combinatorial Thinking Games.Yoko Nishihara & Yukio Ohsawa - 2010 - Transactions of the Japanese Society for Artificial Intelligence 25:485-493.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. Combinatorial Physics.Ted Bastin & C. W. Kilmister - 1995
    Translate
     
     
    Export citation  
     
    My bibliography   2 citations  
  13. Some Combinatorial and Algorithmic Problems in Many-Valued Logics.Ivan Stojmenović - 1987 - University of Novi Sad, Faculty of Science, Institute of Mathematics.
     
    Export citation  
     
    My bibliography  
  14.  75
    Invitation to Fixed-Parameter Algorithms.Rolf Niedermeier - 2006 - Oxford University Press.
    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  
     
    Export citation  
     
    My bibliography  
  15.  6
    Unsolvable Classes of Quantificational Formulas.Harry R. Lewis - 1979 - Addison-Wesley.
  16.  2
    Structuralisme et néoréalisme dans le champ des relations internationales. Le cas de Kenneth Waltz.Alexis Cartonnet - 2011 - Astérion 9.
    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.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17. Combinatorics, Computability and Logic Proceedings of the Third International Conference on Combinatorics, Computability and Logic.Cristian Calude, M. J. Dinneen & Silviu Sburlan - 2001
     
    Export citation  
     
    My bibliography  
  18. Discrete Mathematics and Theoretical Computer Science 4th International Conference, Dmtcs 2003, Dijon, France, July 2003, Proceedings. [REVIEW]Cristian Calude, M. J. Dinneen & Vincent Vajnovszki - 2003
     
    Export citation  
     
    My bibliography  
  19. Die Mathematischen Studien von G.W. Leibniz Zur Kombinatorik Auf Grund Fast Ausschliesslich Handschriftlicher Aufzeichnungen Dargelegt Und Kommentiert.Eberhard Knobloch - 1973 - F. Steiner.
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography  
  20. The Theory of Indistinguishables a Search for Explanatory Principles Below the Level of Physics.A. F. Parker-Rhodes - 1981
     
    Export citation  
     
    My bibliography  
  21. Studies in Foundations and Combinatorics.Gian-Carlo Rota - 1978
     
    Export citation  
     
    My bibliography  
  22. Textbook of Programmed Science and Unified Philosophy: Beyond Socrates to a Theory of the World: A Universal Program Produces a World Theory.Donald O. Rudin - 2001 - Core Books.
     
    Export citation  
     
    My bibliography  
  23. Logic and Combinatorics Proceedings of the Ams-Ims-Siam Joint Summer Research Conference Held August 4-10, 1985.Stephen G. Simpson, American Mathematical Society, Institute of Mathematical Statistics & Society for Industrial and Applied Mathematics - 1987
     
    Export citation  
     
    My bibliography  
  24. Intrinsic Properties and Combinatorial Principles.Brian Weatherson - 2001 - Philosophy and Phenomenological Research 63 (2):365-380.
    Three objections have recently been levelled at the analysis of intrinsicness offered by Rae Langton and David Lewis. While these objections do seem telling against the particular theory Langton and Lewis offer, they do not threaten the broader strategy Langton and Lewis adopt: defining intrinsicness in terms of combinatorial features of properties. I show how to amend their theory to overcome the objections without abandoning the strategy.
    Direct download (12 more)  
     
    Export citation  
     
    My bibliography   19 citations  
  25.  17
    Combinatorial Principles Weaker Than Ramsey's Theorem for Pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.
    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 (8 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  26.  63
    Diagrams and Proofs in Analysis.Jessica Carter - 2010 - International Studies in the Philosophy of Science 24 (1):1 – 14.
    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 (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  27. In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs.Jan Von Plato - 2007 - Bulletin of Symbolic Logic 13 (2):189-225.
    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 (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  28.  26
    A Model-Theoretic Approach to Ordinal Analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
    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 (10 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  29.  1
    The Generic Filter Property in Nonstandard Analysis.Mauro Di Nasso - 2001 - Annals of Pure and Applied Logic 111 (1-2):23-37.
    In this paper two new combinatorial principles in nonstandard analysis are isolated and applications are given. The second principle provides an equivalent formulation of Henson's isomorphism property.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  30.  3
    Systems of Iterated Projective Ordinal Notations and Combinatorial Statements About Binary Labeled Trees.L. Gordeev - 1989 - Archive for Mathematical Logic 29 (1):29-46.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  15
    Scientific Discovery as a Combinatorial Optimisation Problem: How Best to Navigate the Landscape of Possible Experiments?Douglas B. Kell - 2012 - Bioessays 34 (3):236-244.
    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)  
     
    Export citation  
     
    My bibliography  
  32. Intrinsic Properties and Combinatorial Principles.Weatherson Brian - 2001 - Philosophy and Phenomenological Research 63 (2):365-380.
    Three objections have recently been levelled at the analysis of intrinsicness offered by Rae Langton and David Lewis. While these objections do seem telling against the particular theory Langton and Lewis offer, they do not threaten the broader strategy Langton and Lewis adopt: defining intrinsicness in terms of combinatorial features of properties. I show how to amend their theory to overcome the objections without abandoning the strategy.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  33. Intrinsic Properties and Combinatorial Principles.Weatherson Brian - 2001 - Philosophy and Phenomenological Research 63 (2):365-380.
    Three objections have recently been levelled at the analysis of intrinsicness offered by Rae Langton and David Lewis. While these objections do seem telling against the particular theory Langton and Lewis offer, they do not threaten the broader strategy Langton and Lewis adopt: defining intrinsicness in terms of combinatorial features of properties. I show how to amend their theory to overcome the objections without abandoning the strategy.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  34.  18
    Convolution and Modal Representations in Thagard and Stewart’s Neural Theory of Creativity: A Critical Analysis.Jean-Frédéric de Pasquale & Pierre Poirier - 2016 - Synthese 193 (5):1535-1560.
    According to Thagard and Stewart :1–33, 2011), creativity results from the combination of neural representations, and combination results from convolution, an operation on vectors defined in the holographic reduced representation framework. They use these ideas to understand creativity as it occurs in many domains, and in particular in science. We argue that, because of its algebraic properties, convolution alone is ill-suited to the role proposed by Thagard and Stewart. The semantic pointer concept allows us to see how we can apply (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35. From Metaphysics to Ethics: A Defence of Conceptual Analysis.Frank Jackson - 1998 - Oxford University Press.
    Frank Jackson champions the cause of conceptual analysis as central to philosophical inquiry. In recent years conceptual analysis has been undervalued and widely misunderstood, suggests Jackson. He argues that such analysis is mistakenly clouded in mystery, preventing a whole range of important questions from being productively addressed. He anchors his argument in discussions of specific philosophical issues, starting with the metaphysical doctrine of physicalism and moving on, via free will, meaning, personal identity, motion, and change, to ethics (...)
    Direct download  
     
    Export citation  
     
    My bibliography   305 citations  
  36. Counterfactual Attitudes and The Relational Analysis.Kyle H. Blumberg - forthcoming - Mind.
    In this paper, I raise a problem for standard precisifications of The Relational Analysis. The problem I raise involves so–called ‘counterfactual’ attitude verbs, such as ‘wish’. In short, the trouble is this: there are true attitude reports ‘S wishes that P’ but there is no suitable referent for the term ‘that P’. The problematic reports illustrate that the content of a subject’s wish is intimately related to the content of their beliefs. I capture this fact by moving to a (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  37.  95
    A Problem for Fictionalism About Possible Worlds.Gideon Rosen - 1993 - Analysis 53 (2):71 - 81.
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  38. Conceptual Analysis and Reductive Explanation.David J. Chalmers & Frank Jackson - 2001 - Philosophical Review 110 (3):315-61.
    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 . Ned Block and Robert Stalnaker say no.
    Direct download (14 more)  
     
    Export citation  
     
    My bibliography   131 citations  
  39. Recombination and Intrinsicality.Ross P. Cameron - 2008 - Ratio 21 (1):1–12.
    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 (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  40.  35
    Attentional Factors in a Disjunctive Reasoning Task.A. Griggs Richard, D. Platt Richard, E. Newstead Stephen & L. Jackson Sherri - 1998 - Thinking and Reasoning 4 (1):1-14.
    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 (3 more)  
     
    Export citation  
     
    My bibliography  
  41.  18
    Linear Correlates in the Speech Signal: The Orderly Output Constraint.Harvey M. Sussman, David Fruchter, Jon Hilbert & Joseph Sirosh - 1998 - Behavioral and Brain Sciences 21 (2):241-259.
    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)  
     
    Export citation  
     
    My bibliography   2 citations  
  42.  8
    Modèles de la Relation Hôte-Parasite.Daniel Chessel - 1971 - Acta Biotheoretica 20 (1-2):2-17.
    Ce travail présente quelques modèles mathématiques de répartition d'objets dans un ensemble de cases devant servir en particulier à l'analyse des résultats expérimentaux concernant la distribution des œufs d'un parasite dans un groupe de ses hôtes. On trouvera successivement une descriptions des situations concrêtes permettant l'utilisation de tels modèles, un rappel sur le matériel d'analyse combinatoire utilisé, cinq modèles relatifs aux différentes hypothèses de distribution au hasard, réception au hasard, reparasitisme à probabilités constante et variable et un exemple d'application aux (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  43.  4
    The Mapping From Acoustic Structure to the Phonetic Categories of Speech: The Invariance Problem.Sheila E. Blumstein - 1998 - Behavioral and Brain Sciences 21 (2):260-260.
    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)  
     
    Export citation  
     
    My bibliography  
  44.  31
    Vicious Regresses, Conceptual Analysis, and Strong Awareness Internalism.Gregory Stoutenburg - 2016 - Ratio 29 (2):115-129.
    That a philosophical thesis entails a vicious regress is commonly taken to be decisive evidence that the thesis is false. In this paper, I argue that the existence of a vicious regress is insufficient to reject a proposed analysis provided that certain constraints on the analysis are met. When a vicious regress is present, some further consequence of the thesis must be established that, together with the presence of the vicious regress, shows the thesis to be false. The (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   17 citations  
  45. Truth by Analysis: Games, Names, and Philosophy By Colin McGinn. [REVIEW]Tim Button - 2013 - Analysis 73 (3):577-580.
    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 (6 more)  
     
    Export citation  
     
    My bibliography  
  46.  12
    Discounting, Preferences, and Paternalism in Cost-Effectiveness Analysis.Gustav Tinghög - 2012 - Health Care Analysis 20 (3):297-318.
    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)  
     
    Export citation  
     
    My bibliography   2 citations  
  47.  8
    An Ethical Analysis of International Health Priority-Setting.Nuala Kenny & Christine Joffres - 2008 - Health Care Analysis 16 (2):145-160.
    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)  
     
    Export citation  
     
    My bibliography   3 citations  
  48. Complete Analysis and Clarificatory Analysis in Wittgenstein's Tractatus.Dawn M. Phillips - 2007 - In Michael Beaney (ed.), The Analytic Turn: Analysis in Early Analytic Philosophy and Phenomenology. Routledge. pp. 164.
    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 (...)
     
    Export citation  
     
    My bibliography  
  49.  14
    Full Algebra of Generalized Functions and Non-Standard Asymptotic Analysis.Todor D. Todorov & Hans Vernaeve - 2008 - Logic and Analysis 1 (3-4):205-234.
    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)  
     
    Export citation  
     
    My bibliography  
  50.  17
    Beyond “Does It Pay to Be Green?” A Meta-Analysis of Moderators of the CEP–CFP Relationship.Heather R. Dixon-Fowler, Daniel J. Slater, Jonathan L. Johnson, Alan E. Ellstrand & Andrea M. Romi - 2013 - Journal of Business Ethics 112 (2):353-366.
    Review of extant research on the corporate environmental performance (CEP) and corporate financial performance (CFP) link generally demonstrates a positive relationship. However, some arguments and empirical results have demonstrated otherwise. As a result, researchers have called for a contingency approach to this research stream, which moves beyond the basic question “does it pay to be green?” and instead asks “when does it pay to be green?” In answering this call, we provide a meta-analytic review of CEP–CFP literature in which we (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   15 citations  
1 — 50 / 1000