Results for ' strong reduction function'

1000+ found
Order:
  1.  20
    A Reduction in Pain Intensity Is More Strongly Associated With Improved Physical Functioning in Frustration Tolerant Individuals: A Longitudinal Moderation Study in Chronic Pain Patients.Carlos Suso-Ribera, Laura Camacho-Guerrero, Jorge Osma, Santiago Suso-Vergara & David Gallardo-Pujol - 2019 - Frontiers in Psychology 10.
  2.  19
    Neither Weak, Nor Strong? Emergence and Functional Reduction.Sorin Bangu - 2015 - In Brigitte Falkenburg & Margaret Morrison (eds.), Why More is Different: Philosophical Issues in Condensed Matter Physics and Complex Systems. Berlin, Heidelberg: Springer. pp. 253-266.
    The paper argues that the phenomenon of first-order phase transitions (e.g., freezing) has features that make it a candidate to be classified as 'emergent'. However, it cannot be described either as 'weakly emergent' or 'strongly emergent'; hence it escapes categorization in terms employed in the current literature on the metaphysics of science.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  3.  8
    Curricular and architectural encounters with W.G. Sebald: unsettling complacency, reconstructing subjectivity.Teresa Strong-Wilson, Ricardo L. Castro, Warren Crichlow & Amarou Yoder (eds.) - 2023 - New York, NY: Routledge/Taylor & Francis Group.
    This book engages with the writings of W.G. Sebald, mediated by perspectives drawn from curriculum and architecture, to explore the theme of unsettling complacency and confront difficult knowledge around trauma, discrimination and destruction. Moving beyond overly instrumentalist and reductive approaches, the authors combine disciplines in a scholarly fashion to encourage readers to stretch their understandings of currere. The chapters exemplify important, timely and complicated conversations centred on ethical response and responsibility, in order to imagine a more just and aesthetically experienced (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  4.  44
    Construction of models for algebraically generalized recursive function theory.H. R. Strong - 1970 - Journal of Symbolic Logic 35 (3):401-409.
    The Uniformly Reflexive Structure was introduced by E. G. Wagner who showed that the theory of such structures generalized much of recursive function theory. In this paper Uniformly Reflexive Structures are constructed as factor algebras of Free nonassociative algebras. Wagner's question about the existence of a model with no computable splinter ("successor set") is answered in the affirmative by the construction of a model whose only computable sets are the finite sets and their complements. Finally, for each countable Boolean (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  37
    Peace Through Access to Entrepreneurial Capitalism for All.Michael Strong - 2009 - Journal of Business Ethics 89 (S4):529 - 538.
    Nations with legal environments that allow indigenous entrepreneurs to create legal businesses are more likely to be peaceful and prosperous nations. In addition to focusing on the role of multinational corporations, those interested in creating peace through commerce should focus on promoting legal environments that allow indigenous entrepreneurs to create peace and prosperity. In order to illustrate the relationship between improved legal environments and conflict reduction, this article describes a case study in which increased economic freedom led to reduced (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  6
    Brain Response to a Knee Proprioception Task Among Persons With Anterior Cruciate Ligament Reconstruction and Controls.Andrew Strong, Helena Grip, Carl-Johan Boraxbekk, Jonas Selling & Charlotte K. Häger - 2022 - Frontiers in Human Neuroscience 16.
    Knee proprioception deficits and neuroplasticity have been indicated following injury to the anterior cruciate ligament. Evidence is, however, scarce regarding brain response to knee proprioception tasks and the impact of ACL injury. This study aimed to identify brain regions associated with the proprioceptive sense of joint position at the knee and whether the related brain response of individuals with ACL reconstruction differed from that of asymptomatic controls. Twenty-one persons with unilateral ACL reconstruction of either the right or left knee, as (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  36
    Living Ethics.Joseph Solberg, Kelly C. Strong & Charles McGuire - 1995 - Journal of Business Ethics 14 (1):71-81.
    Much has been written recently about both the urgency and efficacy of teaching business ethics. The results of our survey of AACSB member schools confirm prior reports of similar surveys: The teaching of business ethics is indiscriminate, unorganized, and undisciplined in most North American schools of business. If universities are to be taken seriously in their efforts to create more ethical awareness and better moral decision-making skills among their graduates, they must provide a rigorous and well-developed system in which students (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  8.  29
    There is relevance in the classroom: Analysis of present methods of teaching business ethics. [REVIEW]V. K. Strong & A. N. Hoffman - 1990 - Journal of Business Ethics 9 (7):603 - 607.
    In 1988 the Journal of Business Ethics published a paper by David Mathison entitled Business Ethics Cases and Decision Models: A Call for Relevancy in the Classroom. Mathison argued that the present methods of teaching business ethics may be inappropriate for MBA students. He believes that faculty are teaching at one decision-making level and that students are and will be functioning on another (lower) level. The purpose of this paper is to respond to Mathison's arguments and offer support for the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  9. Situated Mediation and Technological Reflexivity: Smartphones, Extended Memory, and Limits of Cognitive Enhancement.Chris Drain & Richard Charles Strong - 2015 - In Frank Scalambrino (ed.), Social Epistemology and Technology: Toward Public Self-Awareness Regarding Technological Mediation. New York: Rowman & Littlefield International. pp. 187-195.
    The situated potentials for action between material things in the world and the interactional processes thereby afforded need to be seen as not only constituting the possibility of agency, but thereby also comprising it. Eo ipso, agency must be de-fused from any local, "contained" subject and be understood as a situational property in which subjects and objects can both participate. Any technological artifact should thus be understood as a complex of agential capacities that function relative to any number of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10. Non-reductive realization and the powers-based subset strategy.Jessica Wilson - 2011 - The Monist (Issue on Powers) 94 (1):121-154.
    I argue that an adequate account of non-reductive realization must guarantee satisfaction of a certain condition on the token causal powers associated with (instances of) realized and realizing entities---namely, what I call the 'Subset Condition on Causal Powers' (first introduced in Wilson 1999). In terms of states, the condition requires that the token powers had by a realized state on a given occasion be a proper subset of the token powers had by the state that realizes it on that occasion. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   102 citations  
  11. Non-reductive physicalism and degrees of freedom.Jessica Wilson - 2010 - British Journal for Philosophy of Science 61 (2):279-311.
    Some claim that Non- reductive Physicalism is an unstable position, on grounds that NRP either collapses into reductive physicalism, or expands into emergentism of a robust or ‘strong’ variety. I argue that this claim is unfounded, by attention to the notion of a degree of freedom—roughly, an independent parameter needed to characterize an entity as being in a state functionally relevant to its law-governed properties and behavior. I start by distinguishing three relations that may hold between the degrees of (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  12.  68
    Non-reductive Physicalism and Degrees of Freedom.Jessica Wilson - 2010 - British Journal for the Philosophy of Science 61 (2):279-311.
    Some claim that Non-reductive Physicalism is an unstable position, on grounds that NRP either collapses into reductive physicalism, or expands into emergentism of a robust or ‘strong’ variety. I argue that this claim is unfounded, by attention to the notion of a degree of freedom—roughly, an independent parameter needed to characterize an entity as being in a state functionally relevant to its law-governed properties and behavior. I start by distinguishing three relations that may hold between the degrees of freedom (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   47 citations  
  13.  53
    Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
    A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numbering to be reduced into corresponding indices of the other numbering. The degrees of partial numberings of a given set with respect to this relation form an upper semilattice.In addition, Ershov’s completion construction for total numberings is extended to the partial case: every partially numbered set can be embedded in a set which (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14.  64
    Kim on Reductive Explanation.Neil Campbell - 2015 - Acta Analytica 30 (2):149-156.
    In the light of what appear to be clear counterexamples, I argue that Jaegwon Kim’s comparative evaluation of functional reduction and reduction via necessary identities is problematic. I trace the problem to two sources: a misplaced metaphysical assumption about the explanatory role of identities and an excessively strong and narrow criterion for successful reductive explanation. Appreciating where Kim’s critique runs astray enhances our understanding of the role of necessary identities in reductive explanation.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  50
    Theory Reduction in Physics: A Model-Based, Dynamical Systems Approach.Joshua Rosaler - unknown
    In 1973, Nickles identified two senses in which the term `reduction' is used to describe the relationship between physical theories: namely, the sense based on Nagel's seminal account of reduction in the sciences, and the sense that seeks to extract one physical theory as a mathematical limit of another. These two approaches have since been the focus of most literature on the subject, as evidenced by recent work of Batterman and Butterfield, among others. In this paper, I discuss (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  16.  29
    On the complexity-relativized strong reducibilites.Jari Talja - 1983 - Studia Logica 42 (2-3):259 - 267.
    This paper discusses refinements of the natural ordering of them-degrees (1-degrees) of strong recursive reducibility classes. Such refinements are obtained by posing complexity conditions on the reduction function. The discussion uses the axiomatic complexity theory and is hence very general. As the main result it is proved that if the complexity measure is required to be linearly bounded (and space-like), then a natural class of refinements forms a lattice with respect to a natural ordering upon them.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17. On the complexity-relativized strong reducibilities.Jari Talja - 1982 - Bulletin of the Section of Logic 11 (1-2):77-78.
    Let A and B be subsets of the set of natural numbers. The well-known strong reducibilities are dened as follows: A m B i 2 B)) A 1 B i A m B and the reduction function f is one-one. where T ot denotes the set of total recursive functions. These reducibilities induce an equivalence relation of interreducibility, the equivalence classes of which are commonly called the m-degrees and the 1-degrees, respectively. The ordering of these degrees has (...)
    No categories
     
    Export citation  
     
    Bookmark  
  18. Towards a General Theory of Reduction. Part III: Cross-Categorical Reduction.C. A. Hooker - 1981 - Dialogue 20 (3):496-529.
    Any theory of reduction that goes only so far as carried in Parts I and II does only half the job. Prima facie at least, there are cases of would-be reduction which seem torn between two conflicting intuitions. On the one side there is a strong intuition that reduction is involved, and a strongly retentive reduction at that. On the other side it seems that the concepts at one level cross-classify those at the other level, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  19. The signal functions of early infant crying.Joseph Soltis - 2004 - Behavioral and Brain Sciences 27 (4):443-458.
    In this article I evaluate recent attempts to illuminate the human infant cry from an evolutionary perspective. Infants are born into an uncertain parenting environment, which can range from indulgent care of offspring to infanticide. Infant cries are in large part adaptations that maintain proximity to and elicit care from caregivers. Although there is not strong evidence for acoustically distinct cry types, infant cries may function as a graded signal. During pain-induced autonomic nervous system arousal, for example, neural (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  20.  35
    La force des dispositifs faibles : la politique de réduction des risques en matière de drogues.Jean-Yves Trépos - 2003 - Cahiers Internationaux de Sociologie 1 (1):93-108.
    La conversion de la France à une politique de « réduction des risques » , est généralement interprétée comme l’indice d’un changement de paradigme en matière de toxicomanie. Il est néanmoins possible de la voir comme une forme de réagencement politique du monde des consommations de drogues, visant à définir de nouveaux seuils, les plus bas possibles, pour l’entrée dans des dispositifs de soin et de service. L’examen des visions du monde sur lesquelles reposent ces équipements politiques, en France comme (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  83
    Enumerations of the Kolmogorov Function.Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan & Leen Torenvliet - 2006 - Journal of Symbolic Logic 71 (2):501 - 528.
    A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determine exactly how hard it is to enumerate the Kolmogorov (...), which assigns to each string x its Kolmogorov complexity: • For every underlying universal machine U, there is a constant a such that C is k(n)-enumerable only if k(n) ≥ n/a for almost all n. • For any given constant k, the Kolmogorov function is k-enumerable relative to an oracle A if and only if A is at least as hard as the halting problem. • There exists an r.e., Turing-incomplete set A such for every non-decreasing and unbounded recursive function k, the Kolmogorov function is k(n)-enumerable relative to A. The last result is obtained by using a relativizable construction for a nonrecursive set A relative to which the prefix-free Kolmogorov complexity differs only by a constant from the unrelativized prefix-free Kolmogorov complexity. Although every 2-enumerator for C is Turing hard for K, we show that reductions must depend on the specific choice of the 2-enumerator and there is no bound on the quantity of their queries. We show our negative results even for strong 2-enumerators as an oracle where the querying machine for any x gets directly an explicit list of all hypotheses of the enumerator for this input. The limitations are very general and we show them for any recursively bounded function g: • For every Turing reduction M and every non-recursive set B, there is a strong 2-enumerator f for g such that M does not Turing reduce B to f. • For every non-recursive set B, there is a strong 2-enumerator f for g such that B is not wtt-reducible to f. Furthermore, we deal with the resource-bounded case and give characterizations for the class ${\rm S}_{2}^{{\rm P}}$ introduced by Canetti and independently Russell and Sundaram and the classes PSPACE, EXP. • ${\rm S}_{2}^{{\rm P}}$ is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time tt-reduction which reduces A to every strong 2-enumerator for g. • PSPACE is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time Turing reduction which reduces A to every strong 2-enumerator for g. Interestingly, g can be taken to be the Kolmogorov function for the conditional space bounded Kolmogorov complexity. • EXP is the class of all sets A for which there is a polynomially bounded function g and a machine M which witnesses A ∈ PSPACEf for all strong 2-enumerators f for g. Finally, we show that any strong O(log n)-enumerator for the conditional space bounded Kolmogorov function must be PSPACE-hard if P = NP. (shrink)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  22.  23
    Strong Reduction of Combinatory Calculus with Streams.Koji Nakazawa & Hiroto Naya - 2015 - Studia Logica 103 (2):375-387.
    This paper gives the strong reduction of the combinatory calculus SCL, which was introduced as a combinatory calculus corresponding to the untyped Lambda-mu calculus. It proves the confluence of the strong reduction. By the confluence, it also proves the conservativity of the extensional equality of SCL over the combinatory calculus CL, and the consistency of SCL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23.  40
    Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (3):652-660.
    In this paper a model for barrecursion is presented. It has as a novelty that it contains discontinuous functionals. The model is based on a concept called strong majorizability. This concept is a modification of Howard's majorizability notion; see [T, p. 456].
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  24.  25
    Visuo-Kinetic Signs Are Inherently Metonymic: How Embodied Metonymy Motivates Forms, Functions, and Schematic Patterns in Gesture.Irene Mittelberg - 2019 - Frontiers in Psychology 10:346848.
    TThis paper aims to evidence the inherently metonymic nature of co-speech gestures. Arguing that motivation in gesture involves iconicity (similarity), indexicality (contiguity), and habit (conventionality) to varying degrees, it demonstrates how a set of metonymic principles may lend a certain systematicity to experientially grounded processes of gestural abstraction and enaction. Introducing visuo-kinetic signs as an umbrella term for co-speech gestures and signed languages, the paper shows how a frame-based approach to gesture may integrate different cognitive/functional linguistic and semiotic accounts of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  25. Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.
  26.  76
    Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
    Light Linear Logic (LLL) and Intuitionistic Light Affine Logic (ILAL) are logics that capture polynomial time computation. It is known that every polynomial time function can be represented by a proof of these logics via the proofs-as-programs correspondence. Furthermore, there is a reduction strategy which normalizes a given proof in polynomial time. Given the latter polynomial time “weak” normalization theorem, it is natural to ask whether a “strong” form of polynomial time normalization theorem holds or not. In (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  8
    Modified strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):265-270.
  28.  10
    Shared and Distinct Patterns of Functional Connectivity to Emotional Faces in Autism Spectrum Disorder and Attention-Deficit/Hyperactivity Disorder Children.Kristina Safar, Marlee M. Vandewouw, Elizabeth W. Pang, Kathrina de Villa, Jennifer Crosbie, Russell Schachar, Alana Iaboni, Stelios Georgiades, Robert Nicolson, Elizabeth Kelley, Muhammed Ayub, Jason P. Lerch, Evdokia Anagnostou & Margot J. Taylor - 2022 - Frontiers in Psychology 13.
    Impairments in emotional face processing are demonstrated by individuals with neurodevelopmental disorders, including autism spectrum disorder and attention-deficit/hyperactivity disorder, which is associated with altered emotion processing networks. Despite accumulating evidence of high rates of diagnostic overlap and shared symptoms between ASD and ADHD, functional connectivity underpinning emotion processing across these two neurodevelopmental disorders, compared to typical developing peers, has rarely been examined. The current study used magnetoencephalography to investigate whole-brain functional connectivity during the presentation of happy and angry faces in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. Reduction, function, and double operationalism in philosophy of biology.Majid Davodi - forthcoming - Philosophical Investigations.
     
    Export citation  
     
    Bookmark  
  30.  8
    Hindley Roger. Axioms for strong reduction in combinatory logic.Haskell B. Curry - 1971 - Journal of Symbolic Logic 36 (1):171-172.
  31.  7
    A standardization theorem for strong reduction.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):271-283.
  32. Axioms for strong reduction in combinatory logic.Roger Hindley - 1967 - Journal of Symbolic Logic 32 (2):224-236.
  33.  13
    Bruce Lercher. Strong reduction and normal form in combinatory logic. The journal of symbolic logic, vol. 32 , pp. 213–223.Luis E. Sanchis - 1971 - Journal of Symbolic Logic 36 (1):171.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34.  19
    Extending strongly continuous functions between apartness spaces.Luminiţa Simona Vîţă - 2006 - Archive for Mathematical Logic 45 (3):351-356.
    A natural extension theorem for strongly continuous mappings, the morphisms in the category of apartness spaces, is proved constructively.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35.  52
    A solution to Curry and Hindley’s problem on combinatory strong reduction.Pierluigi Minari - 2009 - Archive for Mathematical Logic 48 (2):159-184.
    It has often been remarked that the metatheory of strong reduction $\succ$ , the combinatory analogue of βη-reduction ${\twoheadrightarrow_{\beta\eta}}$ in λ-calculus, is rather complicated. In particular, although the confluence of $\succ$ is an easy consequence of ${\twoheadrightarrow_{\beta\eta}}$ being confluent, no direct proof of this fact is known. Curry and Hindley’s problem, dating back to 1958, asks for a self-contained proof of the confluence of $\succ$ , one which makes no detour through λ-calculus. We answer positively to this (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  23
    Superatomic Boolean algebras constructed from strongly unbounded functions.Juan Carlos Martínez & Lajos Soukup - 2011 - Mathematical Logic Quarterly 57 (5):456-469.
    Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ++ + ≤ λ, κ<κ = κ and 2κ = κ+, and η is an ordinal with κ+ ≤ η < κ++ and cf = κ+. Then, in some cardinal-preserving generic extension there is a superatomic Boolean algebra equation image such that equation image, equation image for every α < η and equation image. Especially, equation image and equation image can (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  37.  24
    Roger Hindley. Axioms for strong reduction in combinatory logic. The journal of symbolic logic, vol. 32 , pp. 224–236. - Bruce Lercher. The decidability of Hindley's axioms for strong reduction. The journal of symbolic logic, vol. 32 , pp. 237–239. [REVIEW]Haskell B. Curry - 1971 - Journal of Symbolic Logic 36 (1):171-172.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  38.  8
    Review: Bruce Lercher, Strong Reduction and Normal Form in Combinatory Logic. [REVIEW]Luis E. Sanchis - 1971 - Journal of Symbolic Logic 36 (1):171-171.
  39.  14
    The Class of All Natural Implicative Expansions of Kleene’s Strong Logic Functionally Equivalent to Łkasiewicz’s 3-Valued Logic Ł3.Gemma Robles & José M. Méndez - 2020 - Journal of Logic, Language and Information 29 (3):349-374.
    We consider the logics determined by the set of all natural implicative expansions of Kleene’s strong 3-valued matrix and select the class of all logics functionally equivalent to Łukasiewicz’s 3-valued logic Ł3. The concept of a “natural implicative matrix” is based upon the notion of a “natural conditional” defined in Tomova.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  40.  34
    The decidability of Hindley's axioms for strong reduction.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):237-239.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41.  10
    The Church Rosser theorem for strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (4):299-302.
  42.  10
    On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
    We study the notion of polynomial-time relation reducibility among computable equivalence relations. We identify some benchmark equivalence relations and show that the reducibility hierarchy has a rich structure. Specifically, we embed the partial order of all polynomial-time computable sets into the polynomial-time relation reducibility hierarchy between two benchmark equivalence relations Eλ and id. In addition, we consider equivalence relations with finitely many nontrivial equivalence classes and those whose equivalence classes are all finite.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43.  13
    Projecting sequential algorithms on strongly stable functions.Thomas Ehrhard - 1996 - Annals of Pure and Applied Logic 77 (3):201-244.
    We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the “extensional projections” of some sequential algorithms. We define a model of PCF where morphisms are “extensional” sequential algorithms and prove that any equation between PCF terms which holds in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  87
    Functional reduction and emergence in the physical sciences.Alexander Rueger - 2006 - Synthese 151 (3):335 - 346.
    Kim’s model of ‘functional reduction’ of properties is shown to fail in a class of cases from physics involving properties at different spatial levels. The diagnosis of this failure leads to a non-reductive account of the relation of micro and macro properties.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  45. Does functional reduction need bridge laws? A response to Marras.Kevin Morris - 2009 - British Journal for the Philosophy of Science 60 (3):647-657.
    In his recent article ‘Consciousness and Reduction’, Ausonio Marras argues that functional reduction must appeal to bridge laws and thus does not represent a genuine alternative to Nagelian reduction. In response, I first argue that even if functional reduction must use bridge laws, it still represents a genuine alternative to Nagelian reduction. Further, I argue that Marras does not succeed in showing that functional reduction must use bridge laws. Introduction Nagelian Reduction, Functional (...), and Bridge Laws Marras on Functional Reduction The Logical Space of ‘Bridge Law’ Views of Reduction [RP] as an Account of Realization Conclusion CiteULike Connotea Del.icio.us What's this? (shrink)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  46. Strong Emergence as a Defense of Non-Reductive Physicalism.Carl Gillett - 2002 - Principia: An International Journal of Epistemology 6 (1):87–120.
    Jaegwon Kim, and others, have recently posed a powerful challenge to both emergentism and nom-reductive physicalism by providing arguments that these positions are committed to an untenable combination of both ‘upward’ and ‘dounward’ determination. In section 1, I illuminate how the nature of the realization relation underlies such skeptical arguments However, in section 2, I suggest that such conclusions involve a confusion between the implications of physicalism and those of a related thesis the ‘Completeness of Physics' (Co?) I show that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  47. Strong Representationalism and Bodily Sensations: Reliable Causal Covariance and Biological Function.Coninx Sabrina - 2021 - Philosophical Psychology 34 (2):210-232.
    Bodily sensations, such as pain, hunger, itches, or sexual feelings, are commonly characterized in terms of their phenomenal character. In order to account for this phenomenal character, many philosophers adopt strong representationalism. According to this view, bodily sensations are essentially and entirely determined by an intentional content related to particular conditions of the body. For example, pain would be nothing more than the representation of actual or potential tissue damage. In order to motivate and justify their view, strong (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  48. Functional Reduction with a Third Step:a Larger and Less Reductive Picture.Ronald Endicott - 2022 - ProtoSociology 39:89-106.
    Functional reduction follows two familiar steps: a definition of a higher-level or special science property in terms of a functional role, then a statement describing a physical property that plays or occupies that role. But Kim (2005) adds a third step, namely, an explanation regarding how the physical property occupies the functional role. I think Kim is correct. But how is the third step satisfied? An examination of the pertinent scientific explanations reveals that the third step is best satisfied (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  71
    Strong emergence as a defense of non-reductive physicalism: A physicalist metaphysics for 'downward' determination.Carl Gillett - 2002 - Principia 6 (1):89-120.
    Iaegwon Kim, and others, have recently posed a powerful challen,ge to both emergentism cmd ncm-reductIve physicalism lyy providing arguments that these positums are cornmitted to an untenabie combmation of both `upwarcit and 'clouniwardi determmation. In secuon 1, I illuminate how the nature of the realiza:0n relatzon underlies such sicepucal arguments However, tn secuon 2, I suggest that such conclusicrns involve a confusion between the implications of physicahsm and those of a related thesis the Vompleteness of Physics' (Co?) I show tht (...)
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  50. Theory Reduction by Means of Functional Sub‐types.Michael Esfeld & Christian Sachse - 2007 - International Studies in the Philosophy of Science 21 (1):1 – 17.
    The paper sets out a new strategy for theory reduction by means of functional sub-types. This strategy is intended to get around the multiple realization objection. We use Kim's argument for token identity (ontological reductionism) based on the causal exclusion problem as starting point. We then extend ontological reductionism to epistemological reductionism (theory reduction). We show how one can distinguish within any functional type between functional sub-types. Each of these sub-types is coextensive with one type of realizer. By (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   21 citations  
1 — 50 / 1000