Physicalism, Foundationalism, and Infinite Descent
نویسندگان
چکیده
Abstract This paper contributes to answering the question how physicalism can be defined for a world without fundamental physical phenomena. In recent in this journal, Torin Alter, Sam Coleman, and Robert J. Howell propose necessary condition on physicalism. They argue that is true only if there no infinitely descending chain of mentally constituted I alleged faces counterexamples. An phenomena compatible with Afterwards simpler definition does not fall prey my counterexample.
منابع مشابه
Internalist Foundationalism
I provide a construal of the epistemic regress problem and I take issue with the contention that a foundationalist solution is incompatible with an internalist account of warrant. I sketch a foundationalist solution to the regress problem that respects a plausible version of internalism. I end with the suggestion that the strategy that I have presented is not available only to the traditional v...
متن کاملInfinite Descent on Elliptic Curves
We present an algorithm for computing an upper bound for the difference of the logarithmic height and the canonical height on elliptic curves. Moreover a new method for performing the infinite descent on elliptic curves is given, using ideas from the geometry of numbers. These algorithms are practical and are demonstrated by a few examples.
متن کاملSequent calculi for induction and infinite descent
This paper formalises and compares two different styles of reasoning with inductively defined predicates, each style being encapsulated by a corresponding sequent calculus proof system. The first system, LKID, supports traditional proof by induction, with induction rules formulated as rules for introducing inductively defined predicates on the left of sequents. We show LKID to be cut-free compl...
متن کاملInfiniteBoost: building infinite ensembles with gradient descent
In machine learning ensemble methods have demonstrated high accuracy for the variety of problems in different areas. The most known algorithms intensively used in practice are random forests and gradient boosting. In this paper we present InfiniteBoost — a novel algorithm, which combines the best properties of these two approaches. The algorithm constructs the ensemble of trees for which two pr...
متن کاملThe Method of Infinite Descent in Stable
This paper is a continuation of [Rav02] and the second in a series of papers intended to clarify and expand results of the last chapter of [Rav04], in which we described a method for computing the Adams-Novikov E2-term and used it to determine the stable homotopy groups of spheres through dimension 108 for p = 3 and 999 for p = 5. The latter computation was a substantial improvement over prior ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Erkenntnis
سال: 2023
ISSN: ['0165-0106', '1572-8420']
DOI: https://doi.org/10.1007/s10670-023-00711-5