• PhilPeople
  • PhilPapers
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 

Drag to reposition

Jeffrey Paris
University of Manchester
  •  Home
  •  Publications
    70
    • Most Recent
    • Most Downloaded
    • Topics
  •  Events
    1
  •  News and Updates
    66

 More details
  • University of Manchester
    Regular Faculty
Areas of Interest
Logic and Philosophy of Logic
Philosophy of Probability
  • All publications (70)
  • A model of belief
    with A. Vencovská
    Artificial Intelligence 64 (2): 197-241. 1993.
    Science, Logic, and Mathematics
  •  37
    Frank Ramsey
    with Fraser MacBride, Mathieu Marion, Maria Jose Frapolli, Dorothy Edgington, Edward J. R. Elliott, and Sebastian Lutz
    Stanford Encyclopedia of Philosophy. 2019.
    Frank Plumpton Ramsey (1903–30) made seminal contributions to philosophy, mathematics and economics. Whilst he was acknowledged as a genius by his contemporaries, some of his most important ideas were not appreciated until decades later; now better appreciated, they continue to bear an influence upon contemporary philosophy. His historic significance was to usher in a new phase of analytic philosophy, which initially built upon the logical atomist doctrines of Bertrand Russell and Ludwig Wittgen…Read more
    Frank Plumpton Ramsey (1903–30) made seminal contributions to philosophy, mathematics and economics. Whilst he was acknowledged as a genius by his contemporaries, some of his most important ideas were not appreciated until decades later; now better appreciated, they continue to bear an influence upon contemporary philosophy. His historic significance was to usher in a new phase of analytic philosophy, which initially built upon the logical atomist doctrines of Bertrand Russell and Ludwig Wittgenstein, raising their ideas to a new level of sophistication, but ultimately he became their successor rather than remain a mere acolyte.
    20th Century Analytic Philosophy, Misc
  •  21
    J. I. Friedman. Proper classes as members of extended sets. Mathematische Annalen, vol. 83 , pp. 232–240
    Journal of Symbolic Logic 40 (3): 462. 1975.
    Logic and Philosophy of LogicThe Nature of Sets
  •  54
    McAloon K.. Introduction. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, pp. 1–2.Kirby L. A. S.. La méthode des indicatrices et le théorème d'incomplétude. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, pp. 5–18.Lascar Daniel. Une indicatrice de type “Ramsey” pour l'arithmétique de Peano et la formule de Paris-Harrington. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, 19–30.McAloon Kenneth. Les rapports entre la méthode des indicatrices et la méthode de Gödel pour obtenir des résultats d'indépendance. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, pp. 31–39.McAloon Kenneth. Progressions transfinies de théories axiomatiques, formes combinatoires (review)
    Journal of Symbolic Logic 48 (2): 483-484. 1983.
    Logic and Philosophy of LogicMedieval Logic
  •  14
    Translation Invariance and Miller’s Weather Example
    with A. Vencovská
    Journal of Logic, Language and Information 28 (4): 489-514. 2019.
    In his 1974 paper “Popper’s qualitative theory of verisimilitude” published in the British Journal for the Philosophy of Science David Miller gave his so called ‘Weather Example’ to argue that the Hamming distance between constituents is flawed as a measure of proximity to truth since the former is not, unlike the latter, translation invariant. In this present paper we generalise David Miller’s Weather Example in both the unary and polyadic cases, characterising precisely which permutations of c…Read more
    In his 1974 paper “Popper’s qualitative theory of verisimilitude” published in the British Journal for the Philosophy of Science David Miller gave his so called ‘Weather Example’ to argue that the Hamming distance between constituents is flawed as a measure of proximity to truth since the former is not, unlike the latter, translation invariant. In this present paper we generalise David Miller’s Weather Example in both the unary and polyadic cases, characterising precisely which permutations of constituents/atoms can be effected by translations. In turn this suggests a meta-principle of the rational assignment of subjective probabilities, that rational principles should be preserved under translations, which we formalise and give a particular characterisation of in the context of Unary Pure Inductive Logic.
    Science, Logic, and Mathematics
  •  33
    Franco Montagna, Giulia Simi, and Andrea Sorbi. Logic and probabilistic systems. Archive for mathematical logic, vol. 35 , pp. 225–261 (review)
    Bulletin of Symbolic Logic 6 (2): 223-225. 2000.
    Logic and Philosophy of LogicNonclassical Logics
  •  12
    Pure inductive logic with functions
    with Elizabeth Howarth
    Journal of Symbolic Logic 84 (4): 1382-1402. 2019.
    We consider the version of Pure Inductive Logic which obtains for the language with equality and a single unary function symbol giving a complete characterization of the probability functions on this language which satisfy Constant Exchangeability.
    Epistemic Logic
  •  30
    Six Problems in Pure Inductive Logic
    with A. Vencovská
    Journal of Philosophical Logic 48 (4): 731-747. 2019.
    We present six significant open problems in Pure Inductive Logic, together with their background and current status, with the intention of raising awareness and leading ultimately to their resolution.
    Logics
  •  5
    The Uncertain Reasoner’s Companion
    Erkenntnis 46 (3): 397-400. 1997.
  •  24
    From the Johns Hopkins baby to baby Miller: What have we learned from four decades of reflection on neonatal cases?
    with J. Ferranti and F. Reardon
    Journal of Clinical Ethics 12 (3): 207. 2001.
    Ethics
  •  51
    Symmetry’s End?
    with A. Vencovská
    Erkenntnis 74 (1): 53-67. 2011.
    We examine the idea that similar problems should have similar solutions (to paraphrase van Fraassen’s slogan ‘Problems which are essentially the same must receive essentially the same solution’, see van Fraassen in Laws and symmetry, Oxford Univesity Press, Oxford, 1989, p. 236) in the context of symmetries of sentence algebras within Inductive Logic and conclude that by itself this is too generous a notion upon which to found the rational assignment of probabilities. We also argue that within o…Read more
    We examine the idea that similar problems should have similar solutions (to paraphrase van Fraassen’s slogan ‘Problems which are essentially the same must receive essentially the same solution’, see van Fraassen in Laws and symmetry, Oxford Univesity Press, Oxford, 1989, p. 236) in the context of symmetries of sentence algebras within Inductive Logic and conclude that by itself this is too generous a notion upon which to found the rational assignment of probabilities. We also argue that within our formulation of symmetry the paradoxes associated with the so called ‘Principle of Indifference’ collapse, but only to be replaced by genuinely irremediable examples of the same phenomenon
    Indifference Principles
  •  21
    Proof systems for probabilistic uncertain reasoning
    with A. Vencovská
    Journal of Symbolic Logic 63 (3): 1007-1039. 1998.
    The paper describes and proves completeness theorems for a series of proof systems formalizing common sense reasoning about uncertain knowledge in the case where this consists of sets of linear constraints on a probability function
    Logic and Philosophy of Logic
  •  4
    Proof Systems for Probabilistic Uncertain Reasoning
    with A. Vencovska
    Journal of Symbolic Logic 63 (3): 1007-1039. 1998.
    The paper describes and proves completeness theorems for a series of proof systems formalizing common sense reasoning about uncertain knowledge in the case where this consists of sets of linear constraints on a probability function.
    Logic and Philosophy of Logic
  •  9
    On the emergence of reasons in inductive logic
    with M. Wafy
    Logic Journal of the IGPL 9 (2): 207-216. 2001.
    We apply methods of abduction derived from propositional probabilistic reasoning to predicate probabilistic reasoning, in particular inductive logic, by treating finite predicate knowledge bases as potentially infinite propositional knowledge bases. It is shown that for a range of predicate knowledge bases and several key propositional inference processes this procedure is well defined, and furthermore yields an explanation for the validity of the induction in terms of 'reasons'
    Science, Logic, and MathematicsLogic and Philosophy of Logic
  •  32
    On parameter free induction schemas
    with R. Kaye and C. Dimitracopoulos
    Journal of Symbolic Logic 53 (4): 1082-1097. 1988.
    We present a comprehensive study of the axiom schemas IΣ - n , BΣ - n (induction and collection schemas for parameter free Σ n formulas) and some closely related schemas
    Logic and Philosophy of Logic
  •  6
    Truth definitions without exponentiation and the Σ1 collection scheme
    with Zofia Adamowicz and Leszek Aleksander Kolodziejczyk
    Journal of Symbolic Logic 77 (2): 649. 2012.
    Logic and Philosophy of Logic
  •  41
    O is not enough
    with R. Simmonds
    Review of Symbolic Logic 2 (2): 298-309. 2009.
    We examine the closure conditions of the probabilistic consequence relation of Hawthorne and Makinson, specifically the outstanding question of completeness in terms of Horn rules, of their proposed (finite) set of rules O. We show that on the contrary no such finite set of Horn rules exists, though we are able to specify an infinite set which is complete
    Nonmonotonic Logic
  • Pure Inductive Logic
    with A. Vencovska
    Cambridge University Press. 2011.
    Pure Inductive Logic is the study of rational probability treated as a branch of mathematical logic. This monograph, the first devoted to this approach, brings together the key results from the past seventy years, plus the main contributions of the authors and their collaborators over the last decade, to present a comprehensive account of the discipline within a single unified context.
    Subjective Probability, MiscLogical ProbabilityInductive LogicProbabilistic Principles, Misc
  •  34
    A Note on Irrelevance in Inductive Logic
    with Alena Vencovská
    Journal of Philosophical Logic 40 (3). 2011.
    We consider two formalizations of the notion of irrelevance as a rationality principle within the framework of (Carnapian) Inductive Logic: Johnson's Sufficientness Principle, JSP, which is classically important because it leads to Carnap's influential Continuum of Inductive Methods and the recently proposed Weak Irrelevance Principle, WIP. We give a complete characterization of the language invariant probability functions satisfying WIP which generalizes the Nix-Paris Continuum. We argue that t…Read more
    We consider two formalizations of the notion of irrelevance as a rationality principle within the framework of (Carnapian) Inductive Logic: Johnson's Sufficientness Principle, JSP, which is classically important because it leads to Carnap's influential Continuum of Inductive Methods and the recently proposed Weak Irrelevance Principle, WIP. We give a complete characterization of the language invariant probability functions satisfying WIP which generalizes the Nix-Paris Continuum. We argue that the derivation of two very disparate families of inductive methods from alternative perceptions of 'irrelevance' is an indication that this notion is imperfectly understood at present
    Inductive LogicProbabilistic Principles, MiscSubjective Probability, MiscLogical Probability
  •  235
    The Counterpart Principle of Analogical Support by Structural Similarity
    with Alexandra Hill
    Erkenntnis 79 (S6): 1-16. 2014.
    We propose and investigate an Analogy Principle in the context of Unary Inductive Logic based on a notion of support by structural similarity which is often employed to motivate scientific conjectures.
    Subjective Probability, MiscProbabilistic Principles, MiscCounterpart Theory
  •  72
    Regularity in models of arithmetic
    with George Mills
    Journal of Symbolic Logic 49 (1): 272-280. 1984.
    This paper investigates the quantifier "there exist unboundedly many" in the context of first-order arithmetic. An alternative axiomatization is found for Peano arithmetic based on an axiom schema of regularity: The union of boundedly many bounded sets is bounded. We also obtain combinatorial equivalents of certain second-order theories associated with cuts in nonstandard models of arithmetic
    Logic and Philosophy of LogicModel Theory
  •  58
    Rational Pavelka predicate logic is a conservative extension of łukasiewicz predicate logic
    with Petr Hájek and John Shepherdson
    Journal of Symbolic Logic 65 (2): 669-682. 2000.
    Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants r̄ for rationals in [0, 1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963
    Logic and Philosophy of LogicNonclassical Logics
  •  1
    ZF ⊦ Σ4 0 determinateness
    Journal of Symbolic Logic 37 (4): 661-667. 1972.
    Logic and Philosophy of Logic
  •  12
    Maximum Entropy Inference with Quantified Knowledge
    with Owen Barnett
    Logic Journal of the IGPL 16 (1): 85-98. 2008.
    We investigate uncertain reasoning with quantified sentences of the predicate calculus treated as the limiting case of maximum entropy inference applied to finite domains
    Indifference PrinciplesMaximum Entropy Principles
  •  29
    Review: Franco Montagna, Giulia Simi, Andrea Sorbi, Logic and Probabilistic Systems (review)
    Bulletin of Symbolic Logic 6 (2): 223-225. 2000.
    Logic and Philosophy of LogicLogicsNonclassical Logics
  •  2
    Deriving Information from Inconsistent Knowledge Bases: A Completeness Theorem for η▹η
    Logic Journal of the IGPL 12 (5): 345-353. 2004.
    The logical consequence relations η▹η provide a very attractive way of inferring new facts from inconsistent knowledge bases without compromising standards of credibility. In this short note we provide proof theories and completeness theorems for these consequence relations which may have some applicability in small examples
    Science, Logic, and MathematicsAreas of Mathematics
  •  177
    Second Order Inductive Logic and Wilmers' Principle
    with M. S. Kliess
    Journal of Applied Logic 12 (4): 462-476. 2014.
    We extend the framework of Inductive Logic to Second Order languages and introduce Wilmers' Principle, a rational principle for probability functions on Second Order languages. We derive a representation theorem for functions satisfying this principle and investigate its relationship to the first order principles of Regularity and Super Regularity.
    Subjective Probability, MiscProbabilistic Principles, MiscInductive LogicLogical Probability
  •  9
    A Hierarchy of Cuts in Models of Arithmetic
    with L. Pacholski, J. Wierzejewski, A. J. Wilkie, George Mills, and Jussi Ketonen
    Journal of Symbolic Logic 51 (4): 1062-1066. 1986.
    Logic and Philosophy of LogicModel Theory
  •  19
    The theory of spectrum exchangeability
    with E. Howarth
    Review of Symbolic Logic 8 (1): 108-130. 2015.
    Probabilistic Principles, MiscSubjective Probability, MiscInductive LogicLogical Probability
  •  9
    Rational Pavelka Predicate Logic is a Conservative Extension of Lukasiewicz Predicate Logic
    with Petr Hajek and John Shepherdson
    Journal of Symbolic Logic 65 (2): 669-682. 2000.
    Rational Pavelka logic extends Lukasiewicz infinitely valued logic $by adding truth constants \bar{r} for rationals in [0, 1].$ We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.
    Logic and Philosophy of Logic
  • Prev.
  • 1
  • 2
  • 3
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback