-
39Bayesian epistemology suggests various ways of measuring the support that a piece of evidence provides a hypothesis. Such measures are defined in terms of a subjective probability assignment, pr, over propositions entertained by an agent. The most standard measure (where “H” stands for “hypothesis” and “E” stands for “evidence”) is.
-
200Arguments for probabilism aim to undergird/motivate a synchronic probabilistic coherence norm for partial beliefs. Standard arguments for probabilism are all of the form: An agent S has a non-probabilistic partial belief function b iff (⇐⇒) S has some “bad” property B (in virtue of the fact that their p.b.f. b has a certain kind of formal property F). These arguments rest on Theorems (⇒) and Converse Theorems (⇐): b is non-Pr ⇐⇒ b has formal property F.
-
112mathematicians for over 60 years. Amazingly, the Argonne team's automated theorem-proving program EQP took only 8 days to find a proof of it. Unfortunately, the proof found by EQP is quite complex and difficult to follow. Some of the steps of the EQP proof require highly complex and unintuitive substitution strategies. As a result, it is nearly impossible to reconstruct or verify the computer proof of the Robbins conjecture entirely by hand. This is where the unique symbolic capabilities of Math…Read more
-
99The Naive View (TNV) of Inferential Knowledge (slogan): (TNV) Inferential knowledge requires known relevant premises. One key aspect of (TNV) is “counter-closure” [9, 10].
-
31Intuitively, it seems that S 1 is “more random” or “less regular” than S 2. In other words, it seems more plausible (in some sense) that S 1 (as opposed to S 2) was generated by a random process ( e.g. , by tossing a fair coin eight times, and recording an H for a heads outcome and a T for a tails outcome). We will use the notation x σ 1 ą σ 2y to express the claim that xstring σ 1 is more random than string σ 2y. And, we take it to be intuitively clear that — on any plausible definition of such…Read more
-
84The talk is mainly defensive. I won’t offer positive accounts of the “paradoxical” cases I will discuss (but, see “Extras”). I’ll begin with Harman’s defense of classical deductive logic against certain (epistemological) “relevantist” arguments
-
171Steps Toward a Computational MetaphysicsJournal of Philosophical Logic 36 (2): 227-247. 2007.In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in PROVER9 (a first-order automated reasoning system which is the successor to OTTER). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in PRO…Read more
-
127Popper [3] offers a qualitative definition of the relation “p q” = “p is (strictly) closer to the truth than (i.e., strictly more verisimilar than) q”, using the notions of truth (in the actual world) and classical logical consequence ( ), as follows.
Boston, MA, United States of America
Areas of Specialization
| Metaphysics and Epistemology |
| Science, Logic, and Mathematics |
| Formal Epistemology |