Items where Author is "Paris, J.B."

Paris, J.B. (2017) A note on *-conditioning. Unpublished note. pp. 1-3. (Unpublished)

Paris, J.B. and Vencovska, A. (2017) Ancient Indian Logic and Analogy. [MIMS Preprint]

Paris, J.B. and Vencovska, A. (2017) Combining Analogical Support in Pure Inductive Logic. [MIMS Preprint]

Howarth, E. and Paris, J.B. (2017) The Finite Values Property. [MIMS Preprint]

Paris, J.B. and Vencovska, A. (2016) An inequality concerning the expected values of row-sum and column-sum products in Boolean matrices. [MIMS Preprint]

Paris, J.B. and Vencovská, A. (2016) The Indian Schema as Analogical Reasoning. [MIMS Preprint]

Paris, J.B. (2016) An Equivalent of Language Invariance. [MIMS Preprint]

Howarth, E. and Paris, J.B. and Vencovska, A. (2015) An examination of the SEP Candidate Analogical Inference Rule within Pure Inductive Logic. [MIMS Preprint]

Howarth, E. and Paris, J.B. (2015) The Theory of Spectrum Exchangeability. Review of Symbolic Logic, 8 (01). pp. 108-130.

Paris, J.B. and Vencovska, A. (2015) The Twin Continua of Inductive Methods. In: Logic without Borders. Ontos Mathematical Logic, Volume . De Gruyter, Germany, pp. 355-366. ISBN 978-1-61451-772-6

Kliess, M.S. and Paris, J.B. (2014) Predicate Exchangeability and Language Invariance in Pure Inductive Logic. Logique et Analyse, 228. pp. 413-540.

Howarth, E. and Paris, J.B. (2014) Principles of Remembering and Forgetting. Logique et Analyse, 228. pp. 489-511.

Kliess, M.S. and Paris, J.B. (2014) Second Order Inductive Logic and Wilmers' Principle. Journal of Applied Logic, 12 (4). pp. 462-476.

Nix, C.J. and Paris, J.B. (2006) A continuum of inductive methods arising from a generalized principle of instantial relevance. Journal of Philosophical Logic, 35 (1). pp. 83-115. ISSN 0022-3611

Paris, J.B. and Vencovská, A. (2003) The emergence of reasons conjecture. Journal of Applied Logic, 1 (3-4). pp. 167-195. ISSN 1570-8683

Hill, L.C. and Paris, J.B. (2003) When maximising entropy gives the rational closure. Journal of Logic and Computation, 13 (1). pp. 51-68. ISSN 0955-792X