Results 111 to 120 of about 14,100 (298)

Love and the Basis of Dignity

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract It is often said that dignity is the ground of human rights. But what grounds dignity? According to proponents of the metaphysical view, dignity is grounded in our rational capacities, our sense of justice, or a disjunctive list of valuable capacities.
Jordan David Thomas Walters
wiley   +1 more source

McGee's Counterexample to the Ramsey Test

open access: yes, 2017
Vann McGee has proposed a counterexample to the Ramsey Test. In the counterexample, a seemingly trustworthy source has testified that p and that if not-p, then q. If one subsequently learns not-p (and so learns that the source is wrong about p), then one
Rabinowicz, Wlodek   +10 more
core   +2 more sources

Beyond Immediate Givenness: Husserl's Content‐Apprehension Schema in Light of Merleau‐Ponty's Critique of Sensation

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract Merleau‐Ponty's Phenomenology of Perception (2012 [1945]) opens with a detailed critique of traditional philosophical accounts of sensation, generally understood as having Husserl's “content‐apprehension schema” among its targets. The schema sees perception as resulting from the interpretation (“apprehension” or “apperception”) of “raw ...
Yamina Venuta
wiley   +1 more source

A counterexample to sparse removal

open access: yesEuropean Journal of Combinatorics, 2015
The Turán number of a graph $H$, denoted $\mbox{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph with no subgraph isomorphic to $H$. Solymosi conjectured that if $H$ is any graph and $\mbox{ex}(n,H) = O(n^α)$ where $α> 1$, then any $n$-vertex graph with the property that each edge lies in exactly one copy of $H$ has $o(n^α)$ edges ...
Craig Timmons, Jacques Verstraëte
openaire   +4 more sources

Action in Unison: A Phenomenological Account of Collective Agency in Group Flow States

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract Recently, there has been a burgeoning interest in the so‐called group flow state both in positive psychology and in the phenomenology of collective agency. Group flow is a form of collective agency in which agents experience a sense of intensified efficacy coupled with diminished individual ownership of action and heightened shared ownership ...
Elena Holmgren
wiley   +1 more source

Revisiting McGee’s Counterexample to Modus Ponens

open access: yesEuropean Journal of Analytic Philosophy
In this paper, we provide a novel explanation of McGee’s (1985) alleged counterexample to Modus Ponens for indicative conditionals. Our strategy is to show that pragmatic phenomena interfere with intuitions concerning the acceptability of the inference ...
Nicolás Lo Guercio, Mariela Rubin
doaj   +1 more source

Against Artifactual Epistemic Privilege

open access: yesCrítica, 2018
The deep intentional roots of artifacts and artifactual kinds seem to give intuitive as well as philosophical support to a form of epistemic privilege for makers regarding the objects they create.
Víctor M. Verdejo
doaj   +1 more source

Trapped in the Cave: Toward a Platonic Theory of Ideology

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract This paper is about showing that Plato has a theory of ideology in the broadly Marxist sense of distorted self‐consciousness of social life. Focusing on the Allegory of the Cave and related passages in the Republic, the paper argues that in the Cave, Plato illustrates the social mediation of human psychology, which contributes to the soul's ...
John D. Proios
wiley   +1 more source

On the Dimension of the Group of Projective Transformations of Closed Randers and Riemannian Manifolds

open access: yesSymmetry, Integrability and Geometry: Methods and Applications, 2012
We construct a counterexample to Theorem 2 of [Rafie-Rad M., Rezaei B., SIGMA 7 (2011), 085, 12 pages].
Vladimir S. Matveev
doaj   +1 more source

Counterexample-Preserving Reduction for Symbolic Model Checking

open access: yesJournal of Applied Mathematics, 2014
The cost of LTL model checking is highly sensitive to the length of the formula under verification. We observe that, under some specific conditions, the input LTL formula can be reduced to an easier-to-handle one before model checking. In such reduction,
Wanwei Liu   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy