200 found
Order:
Disambiguations
J. B. Paris [54]John J. Paris [53]Jeffrey Paris [40]Jeff Paris [16]
J. Paris [14]Jean Paris [9]Joel Paris [7]Jeff B. Paris [4]

Not all matches are shown. Search with initial or firstname to single out others.

  1.  45
    The uncertain reasoner's companion: a mathematical perspective.J. B. Paris - 1994 - New York: Cambridge University Press.
    Reasoning under uncertainty, that is, making judgements with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. It is suited for readers with some knowledge of undergraduate mathematics but is otherwise self-contained, collecting together the key results on the subject, and formalising within a unified framework the main contemporary approaches and assumptions. The author has concentrated on giving clear mathematical formulations, analyses, justifications and consequences of the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   49 citations  
  2.  61
    On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
  3.  36
    The Type Theoretic Interpretation of Constructive Set Theory.Peter Aczel, Angus Macintyre, Leszek Pacholski & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):313-314.
    Direct download  
     
    Export citation  
     
    Bookmark   79 citations  
  4. A mathematical incompleteness in Peano arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90--1133.
     
    Export citation  
     
    Bookmark   63 citations  
  5.  36
    Provability of the pigeonhole principle and the existence of infinitely many primes.J. B. Paris, A. J. Wilkie & A. R. Woods - 1988 - Journal of Symbolic Logic 53 (4):1235-1244.
  6. The liar paradox and fuzzy logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
    Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}(\bar{\varphi})$ for all sentences φ? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  7.  21
    In defense of the maximum entropy inference process.J. Paris & A. Vencovská - 1997 - International Journal of Approximate Reasoning 17 (1):77-103.
    This paper is a sequel to an earlier result of the authors that in making inferences from certain probabilistic knowledge bases the maximum entropy inference process, ME, is the only inference process respecting “common sense.” This result was criticized on the grounds that the probabilistic knowledge bases considered are unnatural and that ignorance of dependence should not be identified with statistical independence. We argue against these criticisms and also against the more general criticism that ME is representation dependent. In a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  8.  12
    Pure Inductive Logic.Jeffrey Paris & Alena Vencovská - 2011 - Cambridge, UK: Cambridge University Press. Edited by Alena Vencovská.
    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.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  9. Common sense and maximum entropy.Jeff Paris - 1998 - Synthese 117 (1):75-93.
    This paper concerns the question of how to draw inferences common sensically from uncertain knowledge. Since the early work of Shore and Johnson (1980), Paris and Vencovská (1990), and Csiszár (1989), it has been known that the Maximum Entropy Inference Process is the only inference process which obeys certain common sense principles of uncertain reasoning. In this paper we consider the present status of this result and argue that within the rather narrow context in which we work this complete and (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  10.  57
    On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
    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.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  11.  20
    Initial Segments of Models of Peano's Axioms.L. A. S. Kirby, J. B. Paris, A. Lachlan, M. Srebrny & A. Zarach - 1983 - Journal of Symbolic Logic 48 (2):482-483.
  12.  90
    Frank Ramsey.Fraser MacBride, Mathieu Marion, Maria Jose Frapolli, Dorothy Edgington, Edward J. R. Elliott, Sebastian Lutz & Jeffrey Paris - 2019 - Stanford Encyclopedia of Philosophy.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  13.  42
    “Brain Death,” “Dead,” and Parental Denial.John J. Paris, Brian M. Cummings & M. Patrick Moore - 2014 - Cambridge Quarterly of Healthcare Ethics 23 (4):371-382.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  14.  58
    O is not enough.J. B. Paris & R. Simmonds - 2009 - Review of Symbolic Logic 2 (2):298-309.
    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.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  15.  42
    The liar paradox and fuzzy logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
    Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying “xis true” and satisfying the “dequotation schema”for all sentences φ? This problem is investigated in the frame of Łukasiewicz infinitely valued logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  16.  90
    Some observations on induction in predicate probabilistic reasoning.M. J. Hill, J. B. Paris & G. M. Wilmers - 2002 - Journal of Philosophical Logic 31 (1):43-75.
    We consider the desirability, or otherwise, of various forms of induction in the light of certain principles and inductive methods within predicate uncertain reasoning. Our general conclusion is that there remain conflicts within the area whose resolution will require a deeper understanding of the fundamental relationship between individuals and properties.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  17.  58
    Atom Exchangeability and Instantial Relevance.J. B. Paris & P. Waterhouse - 2009 - Journal of Philosophical Logic 38 (3):313-332.
    We give an account of some relationships between the principles of Constant and Atom Exchangeability and various generalizations of the Principle of Instantial Relevance within the framework of Inductive Logic. In particular we demonstrate some surprising and somewhat counterintuitive dependencies of these relationships on ostensibly unimportant parameters, such as the number of predicates in the overlying language.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  18.  55
    A Continuum of Inductive Methods Arising from a Generalized Principle of Instantial Relevance.C. J. Nix & J. B. Paris - 2006 - Journal of Philosophical Logic 35 (1):83-115.
    In this paper we consider a natural generalization of the Principle of Instantial Relevance and give a complete characterization of the probabilistic belief functions satisfying this principle as a family of discrete probability functions parameterized by a single real δ ∊ [0, 1).
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  19.  51
    An Analogy Principle in Inductive Logic.A. Hill & J. B. Paris - 2013 - Annals of Pure and Applied Logic 164 (12):1293-1321.
    We propose an Analogy Principle in the context of Unary Inductive Logic and characterize the probability functions which satisfy it. In particular in the case of a language with just two predicates the probability functions satisfying this principle correspond to solutions of Skyrmsʼ ‘Wheel of Fortune’.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  20.  17
    Lies, Damned Lies, and Bioethicists.Brian M. Cummings & John J. Paris - 2021 - American Journal of Bioethics 21 (5):24-26.
    The opening sentence of Christopher Meyers’ Target Article is “Lying to one’s patient is wrong”. The author continues, “This truism is one that bioethicists have heartedly endorsed fo...
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  37
    Approaches to parental demand for non-established medical treatment: reflections on the Charlie Gard case.John J. Paris, Brian M. Cummings, Michael P. Moreland & Jason N. Batten - 2018 - Journal of Medical Ethics 44 (7):443-447.
    The opinion of Mr. Justice Francis of the English High Court which denied the parents of Charlie Gard, who had been born with an extremely rare mutation of a genetic disease, the right to take their child to the United States for a proposed experimental treatment occasioned world wide attention including that of the Pope, President Trump, and the US Congress. The case raise anew a debate as old as the foundation of Western medicine on who should decide and on (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  22.  81
    Rational Pavelka predicate logic is a conservative extension of łukasiewicz predicate logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (2):669-682.
    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.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  23.  23
    A Hierarchy of Cuts in Models of Arithmetic.J. B. Paris, L. Pacholski, J. Wierzejewski, A. J. Wilkie, George Mills & Jussi Ketonen - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.
  24.  73
    A Note on Binary Inductive Logic.C. J. Nix & J. B. Paris - 2007 - Journal of Philosophical Logic 36 (6):735-771.
    We consider the problem of induction over languages containing binary relations and outline a way of interpreting and constructing a class of probability functions on the sentences of such a language. Some principles of inductive reasoning satisfied by these probability functions are discussed, leading in turn to a representation theorem for a more general class of probability functions satisfying these principles.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  25.  26
    Maximum Entropy Inference with Quantified Knowledge.Owen Barnett & Jeff Paris - 2008 - Logic Journal of the IGPL 16 (1):85-98.
    We investigate uncertain reasoning with quantified sentences of the predicate calculus treated as the limiting case of maximum entropy inference applied to finite domains.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  26.  41
    A Note on a Theorem of H. FRIEDMAN.C. Dimitracopoulos & J. Paris - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):13-17.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  27.  26
    Ventilator Allocation for Pediatrics during COVID-19 – How We Avoided Drawing Lots for Tots.Neil D. Fernandes, Kelly Gardner, John J. Paris & Brian M. Cummings - 2020 - American Journal of Bioethics 20 (7):147-150.
    Volume 20, Issue 7, July 2020, Page 147-150.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  28.  46
    A characterization of the language invariant families satisfying spectrum exchangeability in polyadic inductive logic.Jürgen Landes, Jeff B. Paris & Alena Vencovská - 2010 - Annals of Pure and Applied Logic 161 (6):800-811.
    A necessary and sufficient condition in terms of a de Finetti style representation is given for a probability function in Polyadic Inductive Logic to satisfy being part of a Language Invariant family satisfying Spectrum Exchangeability. This theorem is then considered in relation to the unary Carnap and Nix–Paris Continua.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  29.  39
    Autonomy Does Not Confer Sovereignty on the Patient: A Commentary on the Golubchuk Case.John J. Paris - 2010 - American Journal of Bioethics 10 (3):54-56.
  30.  40
    A Note on Priest's Finite Inconsistent Arithmetics.J. B. Paris & N. Pathmanathan - 2006 - Journal of Philosophical Logic 35 (5):529-537.
    We give a complete characterization of Priest's Finite Inconsistent Arithmetics observing that his original putative characterization included arithmetics which cannot in fact be realized.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  31.  41
    On LP -models of arithmetic.J. B. Paris & A. Sirokofskich - 2008 - Journal of Symbolic Logic 73 (1):212-226.
    We answer some problems set by Priest in [11] and [12], in particular refuting Priest's Conjecture that all LP-models of Th(N) essentially arise via congruence relations on classical models of Th(N). We also show that the analogue of Priest's Conjecture for I δ₀ + Exp implies the existence of truth definitions for intervals [0,a] ⊂ₑ M ⊨ I δ₀ + Exp in any cut [0,a] ⊂e K ⊆ M closed under successor and multiplication.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  32. A note on the rational closure of knowledge bases with both positive and negative knowledge.R. Booth & J. B. Paris - 1998 - Journal of Logic, Language and Information 7 (2):165-190.
    The notion of the rational closure of a positive knowledge base K of conditional assertions θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} |∼ φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} (standing for if θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document} then normally φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$i$$ \end{document}) was first introduced by Lehmann (1989) and developed by Lehmann and Magidor (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  33.  24
    Pure inductive logic with functions.Elizabeth Howarth & Jeffrey B. Paris - 2019 - Journal of Symbolic Logic 84 (4):1382-1402.
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  33
    A note on the undefinability of cuts.J. B. Paris & C. Dimitracopoulos - 1983 - Journal of Symbolic Logic 48 (3):564-569.
  35.  80
    Some independence results for peano arithmetic.J. B. Paris - 1978 - Journal of Symbolic Logic 43 (4):725-731.
  36.  94
    A survey of some recent results on Spectrum Exchangeability in Polyadic Inductive Logic.J. Landes, J. B. Paris & A. Vencovská - 2011 - Synthese 181 (S1):19 - 47.
    We give a unified account of some results in the development of Polyadic Inductive Logic in the last decade with particular reference to the Principle of Spectrum Exchangeability, its consequences for Instantial Relevance, Language Invariance and Johnson's Sufficientness Principle, and the corresponding de Finetti style representation theorems.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  37.  7
    What You See Is What You Get.Jeff B. Paris - 2014 - Entropy 16 (11):6186-6194.
    This paper corrects three widely held misunderstandings about Maxent when used in common sense reasoning: That it is language dependent; That it produces objective facts; That it subsumes, and so is at least as untenable as, the paradox-ridden Principle of Insufficient Reason.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  38.  62
    Some Aspects of Polyadic Inductive Logic.Jürgen Landes, Jeff Paris & Alena Vencovská - 2008 - Studia Logica 90 (1):3-16.
    We give a brief account of some de Finetti style representation theorems for probability functions satisfying Spectrum Exchangeability in Polyadic Inductive Logic, together with applications to Non-splitting, Language Invariance, extensions with Equality and Instantial Relevance.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  39.  11
    Common sense and stochastic independence.J. B. Paris & A. Vencovská - 2001 - In David Corfield & Jon Williamson (eds.), Foundations of Bayesianism. Kluwer Academic Publishers. pp. 203--240.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  40.  49
    Physician Refusal of Requests for Futile or Ineffective Interventions.John J. Paris & Frank E. Reardon - 1992 - Cambridge Quarterly of Healthcare Ethics 1 (2):127.
    Several recent articles raise an issue long unaddressed in the medical literature: physician compliance with patient or family requests for futile or ineffectice therapy. Although they agree philosophically that such treatment ought not be given, most physicians have followed the course described by Stanley Fiel, in which a young patient dying of cystic fibrosis was accepted “for evaluation” by a transplant center even though he has already passed the threshold of viability as a candidate for a heart-lung transplant. Dr. Fiel (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  41. The Counterpart Principle of Analogical Support by Structural Similarity.Alexandra Hill & Jeffrey Bruce Paris - 2014 - Erkenntnis 79 (S6):1-16.
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  17
    On some formalized conservation results in arithmetic.P. Clote, P. Hájek & J. Paris - 1990 - Archive for Mathematical Logic 30 (4):201-218.
    IΣ n andBΣ n are well known fragments of first-order arithmetic with induction and collection forΣ n formulas respectively;IΣ n 0 andBΣ n 0 are their second-order counterparts. RCA0 is the well known fragment of second-order arithmetic with recursive comprehension;WKL 0 isRCA 0 plus weak König's lemma. We first strengthen Harrington's conservation result by showing thatWKL 0 +BΣ n 0 is Π 1 1 -conservative overRCA 0 +BΣ n 0 . Then we develop some model theory inWKL 0 and illustrate (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  43.  19
    Improving Fairness in Coverage Decisions: Insights from the Harvard Community Health Plan's LORAN Commission Report.John J. Paris - 2004 - American Journal of Bioethics 4 (3):103-104.
    As the only nation in the western world without a national health insurance program, the United States faces ongoing issues of access and fairness in health care coverage. The Clinton administration tried and failed to address the problem of universal coverage. Since then we have focused on the narrower, but nonetheless real, issues of fairness and equity in the benefits package provided in insurance plans. The LORAN Commission spent two years trying to devise agreed-upon principles to govern such issues. The (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  44.  31
    Proof systems for probabilistic uncertain reasoning.J. Paris & A. Vencovská - 1998 - Journal of Symbolic Logic 63 (3):1007-1039.
    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.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  45.  18
    O is Not Enough.J. B. Paris - 2009 - Review of Symbolic Logic 2 (2):298.
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  46.  67
    Rationality As Conformity.Hykel Hosni & Jeff Paris - 2005 - Synthese 144 (2):249-285.
    We argue in favour of identifying one aspect of rational choice with the tendency to conform to the choice you expect another like-minded, but non-communicating, agent to make and study this idea in the very basic case where the choice is from a non-empty subset K of 2 A and no further structure or knowledge of A is assumed.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47.  19
    A Pandemic Refocuses Bioethics on “The Big Questions”.Brian M. Cummings & John J. Paris - 2020 - American Journal of Bioethics 20 (12):51-54.
    To paraphrase Lewis Carroll’s poem “The Walrus and the Carpenter” from his Through the Looking Glass, “The time has come to talk of many things.” Not as the Walrus did in the nursery rhyme, “of sho...
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  38
    The Pigeonhole Principle and Fragments of Arithmetic.C. Dimitracopoulos & J. Paris - 1986 - Mathematical Logic Quarterly 32 (1-5):73-80.
  49.  34
    An examination of the SEP candidate analogical inference rule within pure inductive logic.E. Howarth, J. B. Paris & A. Vencovská - 2016 - Journal of Applied Logic 14:22-45.
  50.  91
    Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
    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.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
1 — 50 / 200