Jeff B. Paris

Orcid: 0000-0001-5708-9833

Affiliations:
  • University of Manchester, UK


According to our database1, Jeff B. Paris authored at least 77 papers between 1972 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Pure Inductive Logic with Functions.
J. Symb. Log., 2019

Six Problems in Pure Inductive Logic.
J. Philos. Log., 2019

Translation Invariance and Miller's Weather Example.
J. Log. Lang. Inf., 2019

2017
Ancient Indian Logic and Analogy.
Proceedings of the Logic and Its Applications - 7th Indian Conference, 2017

2016
An examination of the SEP candidate analogical inference rule within pure inductive logic.
J. Appl. Log., 2016

The Indian Schema Analogy Principles.
FLAP, 2016

The Finite Values Property.
Proceedings of the Computational Models of Rationality, 2016

2015
The Theory of spectrum Exchangeability.
Rev. Symb. Log., 2015

The Twin Continua of Inductive Methods.
Proceedings of the Logic Without Borders, 2015

2014
Second order inductive logic and Wilmers' principle.
J. Appl. Log., 2014

What You See Is What You Get.
Entropy, 2014

2013
An observation on Carnap's Continuum and stochastic independencies.
J. Appl. Log., 2013

An Analogy Principle in Inductive Logic.
Ann. Pure Appl. Log., 2013

2012
Truth definitions without exponentiation and the Σ₁ collection scheme.
J. Symb. Log., 2012

Symmetry in Polyadic Inductive Logic.
J. Log. Lang. Inf., 2012

2011
A survey of some recent results on Spectrum Exchangeability in Polyadic Inductive Logic.
Synth., 2011

A Note on Irrelevance in Inductive Logic.
J. Philos. Log., 2011

A Note on Nathanial's Invariance Principle in Polyadic Inductive Logic.
Proceedings of the Logic and Its Applications - 4th Indian Conference, 2011

2010
A characterization of the Language Invariant families satisfying Spectrum Exchangeability in Polyadic Inductive Logic.
Ann. Pure Appl. Log., 2010

A Note on the Least Informative Model of a Theory.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
O is not Enough.
Rev. Symb. Log., 2009

Atom Exchangeability and Instantial Relevance.
J. Philos. Log., 2009

Inconsistency as qualified truth: A probability logic approach.
Int. J. Approx. Reason., 2009

Representation theorems for probability functions satisfying spectrum exchangeability in inductive logic.
Int. J. Approx. Reason., 2009

Instantial Relevance in Polyadic Inductive Logic.
Proceedings of the Logic and Its Applications, Third Indian Conference, 2009

A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Information from Inconsistent Knowledge: A Probability Logic Approach.
Proceedings of the Interval / Probabilistic Uncertainty and Non-Classical Logics, 2008

Some Aspects of Polyadic Inductive Logic.
Stud Logica, 2008

On <i>LP</i>-models of arithmetic.
J. Symb. Log., 2008

Maximum Entropy Inference with Quantified Knowledge.
Log. J. IGPL, 2008

Inference Processes for Quantified Predicate Knowledge.
Proceedings of the Logic, 2008

2007
A Note on Binary Inductive Logic.
J. Philos. Log., 2007

Language Invariance and Spectrum Exchangeability in Inductive Logic.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2007

2006
A Note on Priest's Finite Inconsistent Arithmetics.
J. Philos. Log., 2006

A Continuum of Inductive Methods Arising from a Generalized Principle of Instantial Relevance.
J. Philos. Log., 2006

2005
Rationality As Conformity.
Synth., 2005

On Filling-in Missing Conditional Probabilities in Causal Networks.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2005

2004
Deriving Information from Inconsistent Knowledge Bases: A Completeness Theorem for <sup>eta</sup>triangel right<sub>eta</sub>.
Log. J. IGPL, 2004

2003
When Maximizing Entropy gives the Rational Closure.
J. Log. Comput., 2003

The emergence of reasons conjecture.
J. Appl. Log., 2003

2002
Some Observations on Induction in Predicate Probabilistic Reasoning.
J. Philos. Log., 2002

There Is a Reason for Everything (Probably): On the Application of Maxent to Induction.
Proceedings of the Conditionals, Information, and Inference, International Workshop, 2002

2001
On the Emergence of Reasons in Inductive Logic.
Log. J. IGPL, 2001

A note on the Dutch Book method.
Proceedings of the ISIPTA '01, 2001

2000
Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic.
J. Symb. Log., 2000

The Liar Paradox and Fuzzy Logic.
J. Symb. Log., 2000

A New Criterion for Comparing Fuzzy Logics for Uncertain Reasoning.
J. Log. Lang. Inf., 2000

On the Structure of Probability Functions in the Natural World.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2000

1999
On the Distribution of Natural Probability Functions.
Proceedings of the ISIPTA '99, Proceedings of the First International Symposium on Imprecise Probabilities and Their Applications, held at the Conference Center "Het Pand" of the Universiteit Gent, Ghent, Belgium, 29 June, 1999

1998
Common Sense and Maximum Entropy.
Synth., 1998

Proof Systems for Probabilistic Uncertain Reasoning.
J. Symb. Log., 1998

A Note on the Rational Closure of Knowledge Bases with Both Positive and Negative Knowledge.
J. Log. Lang. Inf., 1998

1997
A semantics for Fuzzy Logic.
Soft Comput., 1997

A dialogue on fuzzy logic.
Soft Comput., 1997

In defense of the maximum entropy inference process.
Int. J. Approx. Reason., 1997

1995
Belief Formation by Constructing Models.
Proceedings of the Reasoning with Uncertainty in Robotics, International Workshop, 1995

1994
A Natural Prior Probability Distribution Derived from the Propositional Calculus.
Ann. Pure Appl. Log., 1994

1993
A Model of Belief.
Artif. Intell., 1993

1992
A method for updating that justifies minimum cross entropy.
Int. J. Approx. Reason., 1992

Subsets of models of arithmetic.
Arch. Math. Log., 1992

1990
A note on the infeasibility of some inference processes.
Int. J. Intell. Syst., 1990

A note on the inevitability of maximum entropy.
Int. J. Approx. Reason., 1990

On some formalized conservation results in arithmetic.
Arch. Math. Log., 1990

1989
On the applicability of maximum entropy to inexact reasoning.
Int. J. Approx. Reason., 1989

1988
A Note on a Theorem of H. FRIEDMAN.
Math. Log. Q., 1988

Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes.
J. Symb. Log., 1988

On Parameter Free Induction Schemas.
J. Symb. Log., 1988

1987
On the scheme of induction for bounded arithmetic formulas.
Ann. Pure Appl. Log., 1987

Combinatorial principles concerning approximations of functions.
Arch. Math. Log., 1987

1986
The Pigeonhole Principle and Fragments of Arithmetic.
Math. Log. Q., 1986

European Summer Meeting of the Association for Symbolic Logic: Manchester, England, 1984.
J. Symb. Log., 1986

1984
A Property of 2-Sorted Peano Models and Program Verification.
Math. Log. Q., 1984

Regularity in Models of Arithmetic.
J. Symb. Log., 1984

1983
A Note on the Undefinability of Cuts.
J. Symb. Log., 1983

1978
Some Independence Results for Peano Arithmetic.
J. Symb. Log., 1978

Note on an Induction Axiom.
J. Symb. Log., 1978

1972
ZF sigma<sup>0</sup><sub>4</sub> Determinateness.
J. Symb. Log., 1972


  Loading...