Results for 'proof mining'

1000+ found
Order:
  1.  12
    Proof mining in lp spaces.Andrei Sipoş - 2019 - Journal of Symbolic Logic 84 (4):1612-1629.
    We obtain an equivalent implicit characterization of Lp Banach spaces that is amenable to a logical treatment. Using that, we obtain an axiomatization for such spaces into a higher order logical system, the kind of which is used in proof mining, a research program that aims to obtain the hidden computational content of mathematical proofs using tools from mathematical logic. As an aside, we obtain a concrete way of formalizing Lp spaces in positive-bounded logic. The axiomatization is followed (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  39
    Proof Mining in Topological Dynamics.Philipp Gerhardy - 2008 - Notre Dame Journal of Formal Logic 49 (4):431-446.
    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 topological (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  15
    Proof mining in L1-approximation.Ulrich Kohlenbach & Paulo Oliva - 2003 - Annals of Pure and Applied Logic 121 (1):1-38.
    In this paper, we present another case study in the general project of proof mining which means the logical analysis of prima facie non-effective proofs with the aim of extracting new computationally relevant data. We use techniques based on monotone functional interpretation developed in Kohlenbach , Oxford University Press, Oxford, 1996, pp. 225–260) to analyze Cheney's simplification 189) of Jackson's original proof 320) of the uniqueness of the best L1-approximation of continuous functions fC[0,1] by polynomials pPn of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  4.  8
    Proof Mining with the Bounded Functional Interpretation.Pedro Pinto - 2022 - Bulletin of Symbolic Logic 28 (2):265-266.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  8
    Proof mining in< i> L_< sub> 1-approximation.Ulrich Kohlenbach & Paulo Oliva - 2003 - Annals of Pure and Applied Logic 121 (1):1-38.
  6.  3
    Proof mining.Jeremy Avigad - unknown
    Hilbert’s program: • Formalize abstract, infinitary, nonconstructive mathematics. • Prove consistency using only finitary methods.
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  15
    Bounds for indexes of nilpotency in commutative ring theory: A proof mining approach.Fernando Ferreira - 2020 - Bulletin of Symbolic Logic 26 (3-4):257-267.
    It is well-known that an element of a commutative ring with identity is nilpotent if, and only if, it lies in every prime ideal of the ring. A modification of this fact is amenable to a very simple proof mining analysis. We formulate a quantitative version of this modification and obtain an explicit bound. We present an application. This proof mining analysis is the leitmotif for some comments and observations on the methodology of computational extraction. In (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  1
    Light monotone Dialectica methods for proof mining.Mircea-Dan Hernest - 2009 - Mathematical Logic Quarterly 55 (5):551-561.
    In view of an enhancement of our implementation on the computer, we explore the possibility of an algorithmic optimization of the various proof-theoretic techniques employed by Kohlenbach for the synthesis of new effective uniform bounds out of established qualitative proofs in Numerical Functional Analysis. Concretely, we prove that the method of “colouring” some of the quantifiers as “non-computational” extends well to ε-arithmetization, elimination-of-extensionality and model-interpretation.
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  10
    A proof‐theoretic metatheorem for tracial von Neumann algebras.Liviu Păunescu & Andrei Sipoş - 2023 - Mathematical Logic Quarterly 69 (1):63-76.
    We adapt a continuous logic axiomatization of tracial von Neumann algebras due to Farah, Hart and Sherman in order to prove a metatheorem for this class of structures in the style of proof mining, a research programme that aims to obtain the hidden computational content of ordinary mathematical proofs using tools from proof theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10. Proof, Explanation, and Justification in Mathematical Practice.Moti Mizrahi - 2020 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 51 (4):551-568.
    In this paper, I propose that applying the methods of data science to “the problem of whether mathematical explanations occur within mathematics itself” (Mancosu 2018) might be a fruitful way to shed new light on the problem. By carefully selecting indicator words for explanation and justification, and then systematically searching for these indicators in databases of scholarly works in mathematics, we can get an idea of how mathematicians use these terms in mathematical practice and with what frequency. The results of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11. Understanding Therapeutic Change Process Research Through Multilevel Modeling and Text Mining.Wouter A. C. Smink, Jean-Paul Fox, Erik Tjong Kim Sang, Anneke M. Sools, Gerben J. Westerhof & Bernard P. Veldkamp - 2019 - Frontiers in Psychology 10:424969.
    \noindent\textbf{Introduction} Online interventions hold great potential for Therapeutic Change Process Research (TCPR), a field that aims to relate in-therapeutic change processes to the outcomes of interventions. Online a client is treated essentially through the language their counsellor uses, therefore the verbal interaction contains many important ingredients that bring about change. TCPR faces two challenges: how to derive meaningful change processes from texts, and secondly, how to assess these complex, varied and multi-layered processes? We advocate the use text mining and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  7
    On the computational content of the Bolzano-Weierstraß Principle.Pavol Safarik & Ulrich Kohlenbach - 2010 - Mathematical Logic Quarterly 56 (5):508-532.
    We will apply the methods developed in the field of ‘proof mining’ to the Bolzano-Weierstraß theorem BW and calibrate the computational contribution of using this theorem in proofs of combinatorial statements. We provide an explicit solution of the Gödel functional interpretation as well as the monotone functional interpretation of BW for the product space Πi ∈ℕ[–ki, ki] . This results in optimal program and bound extraction theorems for proofs based on fixed instances of BW, i.e. for BW applied (...)
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  14
    Logical metatheorems for accretive and (generalized) monotone set-valued operators.Nicholas Pischke - 2023 - Journal of Mathematical Logic 24 (2).
    Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of certain set-valued mappings between function spaces. This paper deals with the computational properties of these accretive and (generalized) monotone set-valued operators. In particular, we develop (and extend) for this field the theoretical framework of proof mining, a program in mathematical logic that seeks to extract computational information from prima facie “non-computational” proofs from the mainstream literature. To this end, we establish (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14. The objective Bayesian conceptualisation of proof and reference class problems.James Franklin - 2011 - Sydney Law Review 33 (3):545-561.
    The objective Bayesian view of proof (or logical probability, or evidential support) is explained and defended: that the relation of evidence to hypothesis (in legal trials, science etc) is a strictly logical one, comparable to deductive logic. This view is distinguished from the thesis, which had some popularity in law in the 1980s, that legal evidence ought to be evaluated using numerical probabilities and formulas. While numbers are not always useful, a central role is played in uncertain reasoning by (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15.  3
    Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
    This paper addresses the strength of Ramsey's theorem for pairs ($RT^2_2$) over a weak base theory from the perspective of 'proof mining'. Let $RT^{2-}_2$ denote Ramsey's theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König's Lemma and a substantial amount of $\Sigma^0_1$-induction (enough to prove the totality of all primitive recursive functions but not of all primitive recursive functionals). (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  16.  22
    You Show Me Yours, I’ll Show You Mine.Matthew W. Knotts - 2017 - Philosophy and Theology 29 (1):83-100.
    The task of this article is to propose an alternative method for adjudicating truth claims between various paradigms. Informed by sources such as Augustine, Aquinas, Heidegger, Gadamer, and Kuhn, I argue for a form of reasoning which aspires to credibility, plausibility, and explanatory capacity, rather than absolute proof. Instead of representing a flight from scientific standards, I argue that such an approach ultimately represents the best hope of safeguarding the essence of science and rationality as such.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  17.  14
    Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.
    Let the chain antichain principle (CAC) be the statement that each partial order on $\mathbb{N}$ possesses an infinite chain or an infinite antichain. Chong, Slaman, and Yang recently proved using forcing over nonstandard models of arithmetic that CAC is $\Pi^1_1$-conservative over $\text{RCA}_0+\Pi^0_1\text{-CP}$ and so in particular that CAC does not imply $\Sigma^0_2$-induction. We provide here a different purely syntactical and constructive proof of the statement that CAC (even together with WKL) does not imply $\Sigma^0_2$-induction. In detail we show using (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  18.  10
    The computational content of Nonstandard Analysis.Sam Sanders - unknown
    Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of classical mathematics is rather restricted in scope due to the existence of sentences without computational content which are provable from the law of excluded middle and which involve only two quantifier alternations. By contrast, we show that the proof (...) of classical Nonstandard Analysis has a very large scope. In particular, we will observe that this scope includes any theorem of pure Nonstandard Analysis, where 'pure' means that only nonstandard definitions are used. In this note, we survey results in analysis, computability theory, and Reverse Mathematics. (shrink)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  19.  12
    Unifying Functional Interpretations.Paulo Oliva - 2006 - Notre Dame Journal of Formal Logic 47 (2):263-290.
    This article presents a parametrized functional interpretation. Depending on the choice of two parameters one obtains well-known functional interpretations such as Gödel's Dialectica interpretation, Diller-Nahm's variant of the Dialectica interpretation, Kohlenbach's monotone interpretations, Kreisel's modified realizability, and Stein's family of functional interpretations. A functional interpretation consists of a formula interpretation and a soundness proof. I show that all these interpretations differ only on two design choices: first, on the number of counterexamples for A which became witnesses for ¬A when (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  20.  26
    Nonstandard Functional Interpretations and Categorical Models.Amar Hadzihasanovic & Benno van den Berg - 2017 - Notre Dame Journal of Formal Logic 58 (3):343-380.
    Recently, the second author, Briseid, and Safarik introduced nonstandard Dialectica, a functional interpretation capable of eliminating instances of familiar principles of nonstandard arithmetic—including overspill, underspill, and generalizations to higher types—from proofs. We show that the properties of this interpretation are mirrored by first-order logic in a constructive sheaf model of nonstandard arithmetic due to Moerdijk, later developed by Palmgren, and draw some new connections between nonstandard principles and principles that are rejected by strict constructivism. Furthermore, we introduce a variant of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  6
    On Extracting Variable Herbrand Disjunctions.Andrei Sipoş - 2022 - Studia Logica 110 (4):1115-1134.
    Some quantitative results obtained by proof mining take the form of Herbrand disjunctions that may depend on additional parameters. We attempt to elucidate this fact through an extension to first-order arithmetic of the proof of Herbrand’s theorem due to Gerhardy and Kohlenbach which uses the functional interpretation.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22.  8
    Fluctuations, effective learnability and metastability in analysis.Ulrich Kohlenbach & Pavol Safarik - 2014 - Annals of Pure and Applied Logic 165 (1):266-304.
    This paper discusses what kind of quantitative information one can extract under which circumstances from proofs of convergence statements in analysis. We show that from proofs using only a limited amount of the law-of-excluded-middle, one can extract functionals , where L is a learning procedure for a rate of convergence which succeeds after at most B-many mind changes. This -learnability provides quantitative information strictly in between a full rate of convergence and a rate of metastability in the sense of Tao (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  23.  22
    Term extraction and Ramsey's theorem for pairs.Alexander P. Kreuzer & Ulrich Kohlenbach - 2012 - Journal of Symbolic Logic 77 (3):853-895.
    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 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  24.  9
    Gödel functional interpretation and weak compactness.Ulrich Kohlenbach - 2012 - Annals of Pure and Applied Logic 163 (11):1560-1579.
    In recent years, proof theoretic transformations that are based on extensions of monotone forms of Gödel’s famous functional interpretation have been used systematically to extract new content from proofs in abstract nonlinear analysis. This content consists both in effective quantitative bounds as well as in qualitative uniformity results. One of the main ineffective tools in abstract functional analysis is the use of sequential forms of weak compactness. As we recently verified, the sequential form of weak compactness for bounded closed (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  25.  9
    Logical Aspects of Rates of Convergence in Metric Spaces.Eyvind Martol Briseid - 2009 - Journal of Symbolic Logic 74 (4):1401 - 1428.
    In this paper we develop a method for finding, under general conditions, explicit and highly uniform rates of convergence for the Picard iteration sequences for selfmaps on bounded metric spaces from ineffective proofs of convergence to a unique fixed point. We are able to extract full rates of convergence by extending the use of a logical metatheorem recently proved by Kohlenbach. In recent case studies we were able to find such explicit rates of convergence in two concrete cases. Our novel (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  3
    Program extraction for 2-random reals.Alexander P. Kreuzer - 2013 - Archive for Mathematical Logic 52 (5-6):659-666.
    Let ${2-\textsf{RAN}}$ be the statement that for each real X a real 2-random relative to X exists. We apply program extraction techniques we developed in Kreuzer and Kohlenbach (J. Symb. Log. 77(3):853–895, 2012. doi:10.2178/jsl/1344862165), Kreuzer (Notre Dame J. Formal Log. 53(2):245–265, 2012. doi:10.1215/00294527-1715716) to this principle. Let ${{\textsf{WKL}_0^\omega}}$ be the finite type extension of ${\textsf{WKL}_0}$ . We obtain that one can extract primitive recursive realizers from proofs in ${{\textsf{WKL}_0^\omega} + \Pi^0_1-{\textsf{CP}} + 2-\textsf{RAN}}$ , i.e., if ${{\textsf{WKL}_0^\omega} + \Pi^0_1-{\textsf{CP}} + 2-\textsf{RAN} (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  8
    On the Computational Complexity of Best L1-approximation.Paulo Oliva - 2002 - Mathematical Logic Quarterly 48 (S1):66-77.
    It is well known that for a given continuous function f : [0, 1] → ℝ and a number n there exists a unique polynomial pn ∈ Pn which best L1-approximates f. We establish the first upper bound on the complexity of the sequence n∈ ℕ, assuming f is polynomial-time computable. Our complexity analysis makes essential use of the modulus of uniqueness for L1-approximation presented in [13].
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  5
    A note on the monotone functional interpretation.Ulrich Kohlenbach - 2011 - Mathematical Logic Quarterly 57 (6):611-614.
    We prove a result relating the author's monotone functional interpretation to the bounded functional interpretation due to Ferreira and Oliva. More precisely we show that largely a solution for the bounded interpretation also is a solution for the monotone functional interpretation although the latter uses the existence of an underlying precise witness. This makes it possible to focus on the extraction of bounds while using the conceptual benefit of having precise realizers at the same time without having to construct them.
    Direct download  
     
    Export citation  
     
    Bookmark  
  29.  16
    Naturalized Epistemology and the Law of Evidence Revisited.Ronald J. Allen - unknown
    We revisit Naturalized Epistemology and the Law of Evidence, published twenty years ago. The evolution of the relative plausibility theory of juridical proof is offered as evidence of the advantage of a naturalized approach to the study of the field and law evidence. Various alternative explanations of aspects of juridical proof from other disciplines are examined and their shortcomings described. These competing explanations are similar in their reductive, a priori approaches that are at odds with an empirically oriented (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  30.  15
    Personalized Music Recommendation Simulation Based on Improved Collaborative Filtering Algorithm.Hui Ning & Qian Li - 2020 - Complexity 2020:1-11.
    Collaborative filtering technology is currently the most successful and widely used technology in the recommendation system. It has achieved rapid development in theoretical research and practice. It selects information and similarity relationships based on the user’s history and collects others that are the same as the user’s hobbies. User’s evaluation information is to generate recommendations. The main research is the inadequate combination of context information and the mining of new points of interest in the context-aware recommendation process. On the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  13
    ‘X-rays don't tell lies’: the Medical Research Council and the measurement of respiratory disability, 1936–1945.Coreen Mcguire - 2019 - British Journal for the History of Science 52 (3):447-465.
    During the first half of the twentieth century, the mining industry in Britain was subject to recurrent disputes about the risk to miners’ lungs from coal dust, moderated by governmental, industrial, medical and mining bodies. In this environment, precise measurements offered a way to present uncontested objective knowledge. By accessing primary source material from the National Archives, the South Wales Miners Library and the University of Bristol's Special Collections, I demonstrate the importance that the British Medical Research Council (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  13
    Comments on 'nonlocal influences and possible worlds'.Henry P. Stapp - 1990 - British Journal for the Philosophy of Science 41 (1):59-72.
    Clifton, Butterfield, and Redhead [1989] have constructed two separate arguments that bear some resemblances to a proof of mine pertaining to the nonlocal character of quantum theory. Their arguments have flaws, which they point out. I explicate my proof by explaining in detail both how it differs logically from the two arguments they have constructed, and how it avoids the pitfalls of both. *This work was supported by the Director, Office of Energy Research, Office of High Energy and (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  33.  22
    From Argument Schemes to Argumentative Relations in the Wild: A Variety of Contributions to Argumentation Theory.Bart Garssen & Frans van Eemeren (eds.) - 2019 - Cham, Switzerland: Springer Verlag.
    This volume comprises a selection of contributions to the theorizing about argumentation that have been presented at the 9th conference of the International Society for the Study of Argumentation, held in Amsterdam in July 2018. The chapters included provide a general theoretical perspective on central topics in argumentation theory, such as argument schemes and the fallacies. Some contributions concentrate on the treatment of the concept of conductive argument. Other contributions are dedicated to specific issues such as the justification of questions, (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  84
    Advances in Experimental Philosophy of Logic and Mathematics.Andrew Aberdein & Matthew Inglis (eds.) - 2019 - London: Bloomsbury Academic.
    This book explores the results of applying empirical methods to the philosophy of logic and mathematics. Much of the work that has earned experimental philosophy a prominent place in twenty-first century philosophy is concerned with ethics or epistemology. But, as this book shows, empirical methods are just as much at home in logic and the philosophy of mathematics. -/- Chapters demonstrate and discuss the applicability of a wide range of empirical methods including experiments, surveys, interviews, and data-mining. Distinct themes (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  2
    Mathematische Naturphilosophie in der Grundlagendiskussion – Eine Studie über das Verhältnis von Jakob Friedrich Fries’ kritischer Philosophie zu Naturwissenschaft und Mathematik.Kay Herrmann - 2000 - Vandenhoeck & Ruprecht.
    Jakob Friedrich Fries is one of the most important representatives of the Critical Philosophy, someone who built immediately on the original Kantian philosophy. -/- Fries was born in 1773 in Barby (on the Elbe). In 1805 he was extraordinary professor for philosophy in Jena and in the same year was ordinary professor for philosophy in Heidelberg. Returning to Jena in 1816, one year later he was compulsorily retired because of his participation at the nationalistic and republican Wartburg Festival. In 1924 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  36.  13
    From argument schemes to argumentative relations in the wild. A variety of contributions to argumentation theory.Frans Hendrik van Eemeren & Bart Garssen (eds.) - 2019 - Cham, Switzerland: Springer.
    This volume comprises a selection of contributions to the theorizing about argumentation that have been presented at the 9th conference of the International Society for the Study of Argumentation, held in Amsterdam in July 2018. The chapters included provide a general theoretical perspective on central topics in argumentation theory, such as argument schemes and the fallacies. Some contributions concentrate on the treatment of the concept of conductive argument. Other contributions are dedicated to specific issues such as the justification of questions, (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  79
    Preface/Introduction — Hollows of Memory: From Individual Consciousness to Panexperientialism and Beyond.Gregory M. Nixon - 2010 - Journal of Consciousness Exploration and Research 1 (3):213-215.
    Preface/Introduction: The question under discussion is metaphysical and truly elemental. It emerges in two aspects — how did we come to be conscious of our own existence, and, as a deeper corollary, do existence and awareness necessitate each other? I am bold enough to explore these questions and I invite you to come along; I make no claim to have discovered absolute answers. However, I do believe I have created here a compelling interpretation. You’ll have to judge for yourself. -/- (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  87
    Hegel's Ontological Argument: A Reconstruction.Jake McNulty - 2023 - Hegel Bulletin 44 (2):275-296.
    This essay takes up a challenge recently posed by Graham Oppy: to clearly express, in premise-conclusion form, Hegel's version of the ontological argument. In addition to employing this format, it seeks to supplement existing treatments by locating a core component of Hegel's argument in a slightly different place than is common. Whereas some prominent recent treatments (Williams, Bubbio, Melechar) focus on Hegel's definition of the Absolute as the Concept, from the third part of his Science of Logic (the Doctrine of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  8
    Descartes's Dualism (review).Steven J. Wagner - 1999 - Journal of the History of Philosophy 37 (4):678-680.
    In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:Descartes’s Dualism by Marleen RozemondSteven J. WagnerMarleen Rozemond. Descartes’s Dualism. Cambridge: Harvard University Press, 1998. Pp. xx + 279. Cloth, $24.00.Rozemond gives particular attention to questions of mind-body distinctness vs. union and to the status of sensory ideas. Her historical emphasis, backed by impressive scholarship, is Descartes’s relation to the late scholastics. Rozemond is clear, alert to detail, and fair-minded. While the text is too long (esp. in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  40.  8
    Response to Robert Zydenbos' Review of An Introduction to Mādhva Vedānta.Deepak Sarma - 2006 - Philosophy East and West 56 (4):670-674.
    In lieu of an abstract, here is a brief excerpt of the content:Response to Robert Zydenbos' Review of An Introduction to Mādhva VedāntaDeepak SarmaIntroductionI am grateful to the editors of Philosophy East and West for asking me to write a response to Zydenbos' review of my book, An Introduction to Mādhva Vedānta. To this end, I will address four issues: typographical errors, unfounded claims about my translations, content and problems of method and theory, and the future of scholarship in Mādhva (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  41.  12
    Notas sobre a efetividade da doutrina kantiana do direito.Fábio César Scherer - 2010 - Cadernos de Ética E Filosofia Política 17:172-187.
    In this article we assume that the kantian a priori juridical-political theory can be reconstructed according to the a priori synthetic satisfiability proof theory, initially declared in Kritik der reinen Vernunft and extended to practical domain in Kritik der praktischen Vernunft. In particular, it is assumed that the aim to prove that synthetic judgments, such as “this object of external usage is mine”, can a priori invigorate in private law and public law in general – from the determination of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  9
    Pick a number between zero and infinity.David J. Chalmers - manuscript
    In article <[email protected]> [email protected] writes: Reminds me of a friend of mine who claims that the number 17 is "the most random" number. His proof ran as follows: pick a number. It's not really as good a random number as 17, is it? (Invariable Answer: "Umm, well, no...") This reminds me of a little experiment I did a couple of years ago. I stood on a busy street corner in Oxford, and asked passers by to "name a random number (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  43.  6
    Outline of a Nominalist Theory of Propositions: An Essay in the Theory of Meaning and in the Philosophy of Logic.Paul Gochet - 1980 - Dordrecht, Netherland: Springer.
    1. IMPORTANCE OF THE SUBJECT In 1900, in A Critical Exposition of the Philosophy of Leihniz, Russell made the following assertion: "That all sound philosophy should begin with an analysis of propositions is a truth too evident, perhaps, to demand a proof". 1 Forty years later, the interest aroused by this notion had not decreased. C. J. Ducasse wrote in the Journal of Philosophy: "There is perhaps no question more basic for the theory of knowledge than that of the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  11
    Response to Robert Zydenbos' review of.Deepak Sarma - 2006 - Philosophy East and West 56 (4):670-674.
    In lieu of an abstract, here is a brief excerpt of the content:Response to Robert Zydenbos' Review of An Introduction to Mādhva VedāntaDeepak SarmaIntroductionI am grateful to the editors of Philosophy East and West for asking me to write a response to Zydenbos' review of my book, An Introduction to Mādhva Vedānta. To this end, I will address four issues: typographical errors, unfounded claims about my translations, content and problems of method and theory, and the future of scholarship in Mādhva (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  3
    Looking Backward.Michael Mulkay - 1989 - Science, Technology and Human Values 14 (4):441-459.
    Publications in Science, Technology, & Human Values need to have an author. For this reason, I have put my name at the head of this text. I have also provided the title.1 But I must emphasize that the words below are not mine. I have done nothing more, in this case, than transcribe an audio-tape recording2 that has recently come into my possession and submit it to the journal's editor. This latter step seemed to me to be appropriate in view (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  15
    Understanding, formal verification, and the philosophy of mathematics.Jeremy Avigad - 2010 - Journal of the Indian Council of Philosophical Research 27:161-197.
    The philosophy of mathematics has long been concerned with deter- mining the means that are appropriate for justifying claims of mathemat- ical knowledge, and the metaphysical considerations that render them so. But, as of late, many philosophers have called attention to the fact that a much broader range of normative judgments arise in ordinary math- ematical practice; for example, questions can be interesting, theorems important, proofs explanatory, concepts powerful, and so on. The as- sociated values are often loosely classied (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47.  7
    Men with Muskets, Women with Lyres: Nationality, Citizenship, and Gender in the Writings of Germaine de Staël.Susanne Hillman - 2011 - Journal of the History of Ideas 72 (2):231-254.
    In lieu of an abstract, here is a brief excerpt of the content:Men with Muskets, Women with Lyres: Nationality, Citizenship, and Gender in the Writings of Germaine de StaëlSusanne HillmanOn 23 May 1812 Germaine de Staël (1766–1817), Europe’s best-known enemy of Napoleon Bonaparte, set out from her estate on Lake Geneva to escape to England. In her reminiscences, she reflected on the pivotal event as follows:[A]fter ten years of ever-increasing persecutions [...] I was obliged to leave two homelands as a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  60
    Response to Amihud Gilead.Iddo Landau - 2007 - Philosophy and Literature 31 (1):158-161.
    In lieu of an abstract, here is a brief excerpt of the content:Iddo Landau responds:I believe that there is much to learn from Gilead's arguments, and that his paper adds to the understanding of the themes presented in the original discussion. However, in the end I do not think that the claims I made are rebuffed.Gilead should be commended for expanding the discussion of the Mandarin thought experiment (henceforth: Mandarin) from the existentialist context, to which it was limited in my (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  49.  13
    Inferring social networks from unstructured text data: Code and datasets.Christophe Malaterre & Francis Lareau - unknown
    This release includes the data and code used in: Malaterre, C., F. Lareau (2023) Inferring social networks from unstructured text data: A proof of concept detection of “hidden communities of interest”. Text and Data Analytics for Policy.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50.  9
    Response to Robert Zydenbos' Review of "An Introduction to Mādhva Vedānta". [REVIEW]Deepak Sarma - 2006 - Philosophy East and West 56 (4):670 - 674.
    In lieu of an abstract, here is a brief excerpt of the content:Response to Robert Zydenbos' Review of An Introduction to Mādhva VedāntaDeepak SarmaIntroductionI am grateful to the editors of Philosophy East and West for asking me to write a response to Zydenbos' review of my book, An Introduction to Mādhva Vedānta. To this end, I will address four issues: typographical errors, unfounded claims about my translations, content and problems of method and theory, and the future of scholarship in Mādhva (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000