Order:
Disambiguations
J. B. Paris [3]Jeffrey Bruce Paris [1]
  1. 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.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  2. Ancient Indian Logic and Analogy.J. B. Paris & A. Vencovska - 2017 - In S. Ghosh & S. Prasad (eds.), Logic and its Applications, Lecture Notes in Computer Science 10119. Springer. pp. 198-210.
    B.K.Matilal, and earlier J.F.Staal, have suggested a reading of the `Nyaya five limb schema' (also sometimes referred to as the Indian Schema or Hindu Syllogism) from Gotama's Nyaya-Sutra in terms of a binary occurrence relation. In this paper we provide a rational justification of a version of this reading as Analogical Reasoning within the framework of Polyadic Pure Inductive Logic.
    Download  
     
    Export citation  
     
    Bookmark  
  3. An observation on Carnapʼs Continuum and stochastic independencies.J. B. Paris - 2013 - Journal of Applied Logic 11 (4):421-429.
    We characterize those identities and independencies which hold for all probability functions on a unary language satisfying the Principle of Atom Exchangeability. We then show that if this is strengthen to the requirement that Johnson's Sufficientness Principle holds, thus giving Carnap's Continuum of inductive methods for languages with at least two predicates, then new and somewhat inexplicable identities and independencies emerge, the latter even in the case of Carnap's Continuum for the language with just a single predicate.
    Download  
     
    Export citation  
     
    Bookmark  
  4. Second Order Inductive Logic and Wilmers' Principle.M. S. Kliess & J. B. Paris - 2014 - Journal of Applied Logic 12 (4):462-476.
    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.
    Download  
     
    Export citation  
     
    Bookmark