Results for 'Bayes’ theorem'

426 found
Order:
  1. Nature, Science, Bayes 'Theorem, and the Whole of Reality‖.Moorad Alexanian - manuscript
    A fundamental problem in science is how to make logical inferences from scientific data. Mere data does not suffice since additional information is necessary to select a domain of models or hypotheses and thus determine the likelihood of each model or hypothesis. Thomas Bayes’ Theorem relates the data and prior information to posterior probabilities associated with differing models or hypotheses and thus is useful in identifying the roles played by the known data and the assumed prior information when making (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Bayes's Theorem[REVIEW]Massimo Pigliucci - 2005 - Quarterly Review of Biology 80 (1):93-95.
    About a British Academy collection of papers on Bayes' famous theorem.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. Modus Tollens Probabilized: Deductive and Inductive Methods in Medical Diagnosis.Barbara Osimani - 2009 - MEDIC 17 (1/3):43-59.
    Medical diagnosis has been traditionally recognized as a privileged field of application for so called probabilistic induction. Consequently, the Bayesian theorem, which mathematically formalizes this form of inference, has been seen as the most adequate tool for quantifying the uncertainty surrounding the diagnosis by providing probabilities of different diagnostic hypotheses, given symptomatic or laboratory data. On the other side, it has also been remarked that differential diagnosis rather works by exclusion, e.g. by modus tollens, i.e. deductively. By drawing on (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. A Probabilistic Analysis of Argument Cogency.David Godden & Frank Zenker - 2018 - Synthese 195 (4):1715-1740.
    This paper offers a probabilistic treatment of the conditions for argument cogency as endorsed in informal logic: acceptability, relevance, and sufficiency. Treating a natural language argument as a reason-claim-complex, our analysis identifies content features of defeasible argument on which the RSA conditions depend, namely: change in the commitment to the reason, the reason’s sensitivity and selectivity to the claim, one’s prior commitment to the claim, and the contextually determined thresholds of acceptability for reasons and for claims. Results contrast with, and (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  5. Amending the Revisionist Model of the Capgras Delusion: A Further Argument for the Role of Patient Experience in Delusional Belief Formation.Garry Young - 2014 - Avant: Trends in Interdisciplinary Studies (3):89-112.
    Download  
     
    Export citation  
     
    Bookmark  
  6. A Note on Johnson’s ‘A Refutation of Skeptical Theism’.Timothy Perrine - 2015 - Sophia 54 (1):35-43.
    In a recent article, David Kyle Johnson has claimed to have provided a ‘refutation’ of skeptical theism. Johnson’s refutation raises several interesting issues. But in this note, I focus on only one—an implicit principle Johnson uses in his refutation to update probabilities after receiving new evidence. I argue that this principle is false. Consequently, Johnson’s refutation, as it currently stands, is undermined.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Vorlesungsskript: Grundlagen des Entscheidens I.Eckhart Arnold - manuscript
    This is a series of lectures on formal decision theory held at the University of Bayreuth during the summer terms 2008 and 2009. It largely follows the book from Michael D. Resnik: Choices. An Introduction to Decision Theory, 5th ed. Minneapolis London 2000 and covers the topics: -/- Decisions under ignorance and risk Probability calculus (Kolmogoroff Axioms, Bayes' Theorem) Philosophical interpretations of probability (R. v. Mises, Ramsey-De Finetti) Neuman-Morgenstern Utility Theory Introductory Game Theory Social Choice Theory (Sen's Paradox of (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  8. A Comprehensive Theory of Induction and Abstraction, Part I.Cael L. Hasse - manuscript
    I present a solution to the epistemological or characterisation problem of induction. In part I, Bayesian Confirmation Theory (BCT) is discussed as a good contender for such a solution but with a fundamental explanatory gap (along with other well discussed problems); useful assigned probabilities like priors require substantive degrees of belief about the world. I assert that one does not have such substantive information about the world. Consequently, an explanation is needed for how one can be licensed to act as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Evidence, Miracles, and the Existence of Jesus: Comments on Stephen Law.Robert Greg Cavin & Carlos A. Colombetti - 2014 - Faith and Philosophy 31 (2):204-216.
    We use Bayesian tools to assess Law’s skeptical argument against the historicity of Jesus. We clarify and endorse his sub-argument for the conclusion that there is good reason to be skeptical about the miracle claims of the New Testament. However, we dispute Law’s contamination principle that he claims entails that we should be skeptical about the existence of Jesus. There are problems with Law’s defense of his principle, and we show, more importantly, that it is not supported by Bayesian considerations. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10.  58
    Papias's Prologue and the Probability of Parallels.Nevin Climenhaga - 2020 - Journal of Biblical Literature 139 (3):591-596.
    Several scholars, including Martin Hengel, R. Alan Culpepper, and Richard Bauckham, have argued that Papias had knowledge of the Gospel of John on the grounds that Papias’s prologue lists six of Jesus’s disciples in the same order that they are named in the Gospel of John: Andrew, Peter, Philip, Thomas, James, and John. In “A Note on Papias’s Knowledge of the Fourth Gospel” (JBL 129 [2010]: 793–794), Jake H. O’Connell presents a statistical analysis of this argument, according to which the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Is Racial Profiling a Legitimate Strategy in the Fight Against Violent Crime?Neven Sesardić - 2018 - Philosophia 46 (4):981-999.
    Racial profiling has come under intense public scrutiny especially since the rise of the Black Lives Matter movement. This article discusses two questions: whether racial profiling is sometimes rational, and whether it can be morally permissible. It is argued that under certain circumstances the affirmative answer to both questions is justified.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  12. A Theory of Bayesian Groups.Franz Dietrich - 2019 - Noûs 53 (3):708-736.
    A group is often construed as one agent with its own probabilistic beliefs (credences), which are obtained by aggregating those of the individuals, for instance through averaging. In their celebrated “Groupthink”, Russell et al. (2015) require group credences to undergo Bayesian revision whenever new information is learnt, i.e., whenever individual credences undergo Bayesian revision based on this information. To obtain a fully Bayesian group, one should often extend this requirement to non-public or even private information (learnt by not all or (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  13. Assessing Theories, Bayes Style.Franz Huber - 2008 - Synthese 161 (1):89-118.
    The problem addressed in this paper is “the main epistemic problem concerning science”, viz. “the explication of how we compare and evaluate theories [...] in the light of the available evidence” (van Fraassen, BC, 1983, Theory comparison and relevant Evidence. In J. Earman (Ed.), Testing scientific theories (pp. 27–42). Minneapolis: University of Minnesota Press). Sections 1– 3 contain the general plausibility-informativeness theory of theory assessment. In a nutshell, the message is (1) that there are two values a theory should exhibit: (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  14. An Impossibility Theorem for Amalgamating Evidence.Jacob Stegenga - 2013 - Synthese 190 (12):2391-2411.
    Amalgamating evidence of different kinds for the same hypothesis into an overall confirmation is analogous, I argue, to amalgamating individuals’ preferences into a group preference. The latter faces well-known impossibility theorems, most famously “Arrow’s Theorem”. Once the analogy between amalgamating evidence and amalgamating preferences is tight, it is obvious that amalgamating evidence might face a theorem similar to Arrow’s. I prove that this is so, and end by discussing the plausibility of the axioms required for the theorem.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  15. Belief Revision Generalized: A Joint Characterization of Bayes's and Jeffrey's Rules.Franz Dietrich, Christian List & Richard Bradley - 2016 - Journal of Economic Theory 162:352-371.
    We present a general framework for representing belief-revision rules and use it to characterize Bayes's rule as a classical example and Jeffrey's rule as a non-classical one. In Jeffrey's rule, the input to a belief revision is not simply the information that some event has occurred, as in Bayes's rule, but a new assignment of probabilities to some events. Despite their differences, Bayes's and Jeffrey's rules can be characterized in terms of the same axioms: "responsiveness", which requires that revised beliefs (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  16. Arrow's Theorem in Judgment Aggregation.Franz Dietrich & Christian List - 2007 - Social Choice and Welfare 29 (1):19-33.
    In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. Although we (...)
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  17.  98
    Bell’s Theorem, Quantum Probabilities, and Superdeterminism.Eddy Keming Chen - forthcoming - In Eleanor Knox & Alastair Wilson (eds.), The Routledge Companion to the Philosophy of Physics. Routledge.
    In this short survey article, I discuss Bell’s theorem and some strategies that attempt to avoid the conclusion of non-locality. I focus on two that intersect with the philosophy of probability: (1) quantum probabilities and (2) superdeterminism. The issues they raised not only apply to a wide class of no-go theorems about quantum mechanics but are also of general philosophical interest.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  18. A Representation Theorem for Frequently Irrational Agents.Edward Elliott - 2017 - Journal of Philosophical Logic 46 (5):467-506.
    The standard representation theorem for expected utility theory tells us that if a subject’s preferences conform to certain axioms, then she can be represented as maximising her expected utility given a particular set of credences and utilities—and, moreover, that having those credences and utilities is the only way that she could be maximising her expected utility. However, the kinds of agents these theorems seem apt to tell us anything about are highly idealised, being always probabilistically coherent with infinitely precise (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Epistemic Democracy: Generalizing the Condorcet Jury Theorem.Christian List & Robert E. Goodin - 2001 - Journal of Political Philosophy 9 (3):277–306.
    This paper generalises the classical Condorcet jury theorem from majority voting over two options to plurality voting over multiple options. The paper further discusses the debate between epistemic and procedural democracy and situates its formal results in that debate. The paper finally compares a number of different social choice procedures for many-option choices in terms of their epistemic merits. An appendix explores the implications of some of the present mathematical results for the question of how probable majority cycles (as (...)
    Download  
     
    Export citation  
     
    Bookmark   110 citations  
  20. The Impartial Observer Theorem of Social Ethics.Philippe Mongin - 2001 - Economics and Philosophy 17 (2):147-179.
    Following a long-standing philosophical tradition, impartiality is a distinctive and determining feature of moral judgments, especially in matters of distributive justice. This broad ethical tradition was revived in welfare economics by Vickrey, and above all, Harsanyi, under the form of the so-called Impartial Observer Theorem. The paper offers an analytical reconstruction of this argument and a step-wise philosophical critique of its premisses. It eventually provides a new formal version of the theorem based on subjective probability.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  21. A Dutch Book Theorem for Quantificational Credences.Benjamin Lennertz - 2017 - Ergo: An Open Access Journal of Philosophy 4.
    In this paper, I present an argument for a rational norm involving a kind of credal attitude called a quantificational credence – the kind of attitude we can report by saying that Lucy thinks that each record in Schroeder’s collection is 5% likely to be scratched. I prove a result called a Dutch Book Theorem, which constitutes conditional support for the norm. Though Dutch Book Theorems exist for norms on ordinary and conditional credences, there is controversy about the epistemic (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Fermat’s Last Theorem Proved by Induction (and Accompanied by a Philosophical Comment).Vasil Penchev - 2020 - Metaphilosophy eJournal (Elsevier: SSRN) 12 (8):1-8.
    A proof of Fermat’s last theorem is demonstrated. It is very brief, simple, elementary, and absolutely arithmetical. The necessary premises for the proof are only: the three definitive properties of the relation of equality (identity, symmetry, and transitivity), modus tollens, axiom of induction, the proof of Fermat’s last theorem in the case of.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  86
    Bell's Theorem Versus Local Realism in a Quaternionic Model of Physical Space.Joy Christian - 2019 - IEEE Access 7:133388-133409.
    In the context of EPR-Bohm type experiments and spin detections confined to spacelike hypersurfaces, a local, deterministic and realistic model within a Friedmann-Robertson-Walker spacetime with a constant spatial curvature (S^3 ) is presented that describes simultaneous measurements of the spins of two fermions emerging in a singlet state from the decay of a spinless boson. Exact agreement with the probabilistic predictions of quantum theory is achieved in the model without data rejection, remote contextuality, superdeterminism or backward causation. A singularity-free Clifford-algebraic (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  24. The Craig Interpolation Theorem for Prepositional Logics with Strong Negation.Valentin Goranko - 1985 - Studia Logica 44 (3):291 - 317.
    This paper deals with, prepositional calculi with strong negation (N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  25.  86
    Generalized Löb’s Theorem. Strong Reflection Principles and Large Cardinal Axioms.Jaykov Foukzon - 2013 - Advances in Pure Mathematics (3):368-373.
    In this article, a possible generalization of the Löb’s theorem is considered. Main result is: let κ be an inaccessible cardinal, then ¬Con( ZFC +∃κ) .
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  26. The Premises of Condorcet’s Jury Theorem Are Not Simultaneously Justified.Franz Dietrich - 2008 - Episteme 5 (1):56-73.
    Condorcet's famous jury theorem reaches an optimistic conclusion on the correctness of majority decisions, based on two controversial premises about voters: they are competent and vote independently, in a technical sense. I carefully analyse these premises and show that: whether a premise is justi…ed depends on the notion of probability considered; none of the notions renders both premises simultaneously justi…ed. Under the perhaps most interesting notions, the independence assumption should be weakened.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  27. Opinion Leaders, Independence, and Condorcet's Jury Theorem.David M. Estlund - 1994 - Theory and Decision 36 (2):131-162.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  28.  36
    The Kochen - Specker Theorem in Quantum Mechanics: A Philosophical Comment (Part 2).Vasil Penchev - 2013 - Philosophical Alternatives 22 (3):74-83.
    The text is a continuation of the article of the same name published in the previous issue of Philosophical Alternatives. The philosophical interpretations of the Kochen- Specker theorem (1967) are considered. Einstein's principle regarding the,consubstantiality of inertia and gravity" (1918) allows of a parallel between descriptions of a physical micro-entity in relation to the macro-apparatus on the one hand, and of physical macro-entities in relation to the astronomical mega-entities on the other. The Bohmian interpretation ( 1952) of quantum mechanics (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. On Interpreting Chaitin's Incompleteness Theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
    The aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin's famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the limiting constant is determined by the complexity of the theory itself, which is assumed to be good (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  30.  42
    Automated Theorem Proving and Its Prospects. [REVIEW]Desmond Fearnley-Sander - 1995 - PSYCHE: An Interdisciplinary Journal of Research On Consciousness 2.
    REVIEW OF: Automated Development of Fundamental Mathematical Theories by Art Quaife. (1992: Kluwer Academic Publishers) 271pp. Using the theorem prover OTTER Art Quaife has proved four hundred theorems of von Neumann-Bernays-Gödel set theory; twelve hundred theorems and definitions of elementary number theory; dozens of Euclidean geometry theorems; and Gödel's incompleteness theorems. It is an impressive achievement. To gauge its significance and to see what prospects it offers this review looks closely at the book and the proofs it presents.
    Download  
     
    Export citation  
     
    Bookmark  
  31. Composition as Identity and Plural Cantor's Theorem.Einar Duenger Bohn - 2016 - Logic and Logical Philosophy 25 (3).
    I argue that Composition as Identity blocks the plural version of Cantor's Theorem, and that therefore the plural version of Cantor's Theorem can no longer be uncritically appealed to. As an example, I show how this result blocks a recent argument by Hawthorne and Uzquiano.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  85
    Elementary Canonical Formulae: Extending Sahlqvist’s Theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
    We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  33.  75
    Central Limit Theorem for Functional of Jump Markov Processes.Nguyen Van Huu, Quan-Hoang Vuong & Minh-Ngoc Tran - 2005 - Vietnam Journal of Mathematics 33 (4):443-461.
    Some conditions are given to ensure that for a jump homogeneous Markov process $\{X(t),t\ge 0\}$ the law of the integral functional of the process $T^{-1/2} \int^T_0\varphi(X(t))dt$ converges to the normal law $N(0,\sigma^2)$ as $T\to \infty$, where $\varphi$ is a mapping from the state space $E$ into $\bbfR$.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  34. Erratum to “The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories” Logic Journal of the IGPL, 16: 585–590. [REVIEW]Igor Oliveira & Walter Carnielli - 2009 - Logic Journal of the IGPL 17 (6):803-804.
    This note clarifies an error in the proof of the main theorem of “The Ricean Objection: An Analogue of Rice’s Theorem for First-Order Theories”, Logic Journal of the IGPL, 16(6): 585–590(2008).
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  35. A Logic for Frege's Theorem.Richard Heck - 2011 - In Frege’s Theorem: An Introduction. Oxford University Press.
    It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  36.  29
    Making Theorem-Proving in Modal Logic Easy.Paul Needham - 2009 - In Lars-Göran Johansson, Jan Österberg & Rysiek Śliwiński (eds.), Logic, Ethics and All That Jazz: Essays in Honour of Jordan Howard Sobel. Uppsala, Sverige: pp. 187-202.
    A system for the modal logic K furnishes a simple mechanical process for proving theorems.
    Download  
     
    Export citation  
     
    Bookmark  
  37.  19
    From the Four-Color Theorem to a Generalizing “Four-Letter Theorem”: A Sketch for “Human Proof” and the Philosophical Interpretation.Vasil Penchev - 2020 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 12 (21):1-10.
    The “four-color” theorem seems to be generalizable as follows. The four-letter alphabet is sufficient to encode unambiguously any set of well-orderings including a geographical map or the “map” of any logic and thus that of all logics or the DNA plan of any alive being. Then the corresponding maximally generalizing conjecture would state: anything in the universe or mind can be encoded unambiguously by four letters. That admits to be formulated as a “four-letter theorem”, and thus one can (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38.  46
    The Kochen - Specker Theorem in Quantum Mechanics: A Philosophical Comment (Part 1).Vasil Penchev - 2013 - Philosophical Alternatives 22 (1):67-77.
    Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39.  58
    Numerical Infinities Applied for Studying Riemann Series Theorem and Ramanujan Summation.Yaroslav Sergeyev - 2018 - In AIP Conference Proceedings 1978. AIP. pp. 020004.
    A computational methodology called Grossone Infinity Computing introduced with the intention to allow one to work with infinities and infinitesimals numerically has been applied recently to a number of problems in numerical mathematics (optimization, numerical differentiation, numerical algorithms for solving ODEs, etc.). The possibility to use a specially developed computational device called the Infinity Computer (patented in USA and EU) for working with infinite and infinitesimal numbers numerically gives an additional advantage to this approach in comparison with traditional methodologies studying (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Condorcet’s jury theorem: General will and epistemic democracy.Miljan Vasić - 2018 - Theoria: Beograd 61 (4):147-170.
    My aim in this paper is to explain what Condorcet’s jury theorem is, and to examine its central assumptions, its significance to the epistemic theory of democracy and its connection with Rousseau’s theory of general will. In the first part of the paper I will analyze an epistemic theory of democracy and explain how its connection with Condorcet’s jury theorem is twofold: the theorem is at the same time a contributing historical source, and the model used by (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  41.  35
    On a Surprising Oversight by John S. Bell in the Proof of His Famous Theorem.Joy Christian - unknown
    Bell inequalities are usually derived by assuming locality and realism, and therefore violations of the Bell-CHSH inequality are usually taken to imply violations of either locality or realism, or both. But, after reviewing an oversight by Bell, in the Corollary below we derive the Bell-CHSH inequality by assuming only that Bob can measure along vectors b and b' simultaneously while Alice measures along either a or a', and likewise Alice can measure along vectors a and a' simultaneously while Bob measures (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  42. The Relation Between Degrees of Belief and Binary Beliefs: A General Impossibility Theorem.Franz Dietrich & Christian List - forthcoming - In Lotteries, Knowledge, and Rational Belief. Essays on the Lottery Paradox.
    Agents are often assumed to have degrees of belief (“credences”) and also binary beliefs (“beliefs simpliciter”). How are these related to each other? A much-discussed answer asserts that it is rational to believe a proposition if and only if one has a high enough degree of belief in it. But this answer runs into the “lottery paradox”: the set of believed propositions may violate the key rationality conditions of consistency and deductive closure. In earlier work, we showed that this problem (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  81
    Classical Distinguishability and the Gibbs-Liouville Theorem.Andreas Henriksson - manuscript
    It is shown that the theory of classical mechanics can be built from the concept of distinguishability between pairs of classical states. The non-ignorant observer can, with infinite precision, distinguish between arbitrary pairs. Either they are identical, or they are distinct. The distinguishability is postulated to be conserved in time for closed systems. The mathematical representation of this postulate is shown to be given by the Gibbs-Liouville theorem. Alternative statements of this theorem are given. In particular, Hamilton's principle (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  44. On the Depth of Szemeredi's Theorem.Andrew Arana - 2015 - Philosophia Mathematica 23 (2):163-176.
    Many mathematicians have cited depth as an important value in their research. However, there is no single widely accepted account of mathematical depth. This article is an attempt to bridge this gap. The strategy is to begin with a discussion of Szemerédi's theorem, which says that each subset of the natural numbers that is sufficiently dense contains an arithmetical progression of arbitrary length. This theorem has been judged deep by many mathematicians, and so makes for a good case (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  45. Central Limit Theorem for the Functional of Jump Markov Process.Nguyen Van Huu, Quan-Hoang Vuong & Tran Minh Ngoc - 2005 - In Báo cáo: Hội nghị toàn quốc lần thứ III “Xác suất - Thống kê: Nghiên cứu, ứng dụng và giảng dạy”. Ha Noi: Viện Toán học. pp. 34.
    Central limit theorem for the functional of jump Markov process. Nguyễn Văn Hữu, Vương Quân Hoàng và Trần Minh Ngọc. Báo cáo: Hội nghị toàn quốc lần thứ III “Xác suất - Thống kê: Nghiên cứu, ứng dụng và giảng dạy” (tr. 34). Ba Vì, Hà Tây, ngày 12-14 tháng 05 năm 2005. Viện Toán học / Trường Đại học Khoa học tự nhiên / Đại học Quốc gia Hà Nội.
    Download  
     
    Export citation  
     
    Bookmark  
  46. Arrow’s Impossibility Theorem and the National Security State.S. M. Amadae - 2005 - Studies in History and Philosophy of Science Part A 36 (4):734-743.
    This paper critically engages Philip Mirowki's essay, "The scientific dimensions of social knowledge and their distant echoes in 20th-century American philosophy of science." It argues that although the cold war context of anti-democratic elitism best suited for making decisions about engaging in nuclear war may seem to be politically and ideologically motivated, in fact we need to carefully consider the arguments underlying the new rational choice based political philosophies of the post-WWII era typified by Arrow's impossibility theorem. A distrust (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47. Why Arrow's Theorem Matters for Political Theory Even If Preference Cycles Never Occur.Sean Ingham - forthcoming - Public Choice.
    Riker (1982) famously argued that Arrow’s impossibility theorem undermined the logical foundations of “populism”, the view that in a democracy, laws and policies ought to express “the will of the people”. In response, his critics have questioned the use of Arrow’s theorem on the grounds that not all configurations of preferences are likely to occur in practice; the critics allege, in particular, that majority preference cycles, whose possibility the theorem exploits, rarely happen. In this essay, I argue (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. An Arrovian Impossibility Theorem for the Epistemology of Disagreement.Nicholaos Jones - 2012 - Logos and Episteme 3 (1):97-115.
    According to conciliatory views about the epistemology of disagreement, when epistemic peers have conflicting doxastic attitudes toward a proposition and fully disclose to one another the reasons for their attitudes toward that proposition (and neither has independent reason to believe the other to be mistaken), each peer should always change his attitude toward that proposition to one that is closer to the attitudes of those peers with which there is disagreement. According to pure higher-order evidence views, higher-order evidence for a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49.  68
    Tarski Undefinability Theorem Succinctly Refuted.Pete Olcott - manuscript
    If the conclusion of the Tarski Undefinability Theorem was that some artificially constrained limited notions of a formal system necessarily have undecidable sentences, then Tarski made no mistake within his assumptions. When we expand the scope of his investigation to other notions of formal systems we reach an entirely different conclusion showing that Tarski's assumptions were wrong.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  50. On the Martingale Representation Theorem and on Approximate Hedging a Contingent Claim in the Minimum Deviation Square Criterion.Nguyen Van Huu & Quan-Hoang Vuong - 2007 - In Ta-Tsien Li Rolf Jeltsch (ed.), Some Topics in Industrial and Applied Mathematics. Shanghai, China: World Scientific. pp. 134-151.
    In this work we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingale representation in case of discrete time and an application of the result for semi-continuous market model are also given.
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 426