-
30Proof systems for probabilistic uncertain reasoningJournal 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
-
5Proof Systems for Probabilistic Uncertain ReasoningJournal 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.
-
55On parameter free induction schemasJournal 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
-
14Truth definitions without exponentiation and the Σ1 collection schemeJournal of Symbolic Logic 77 (2): 649. 2012.
-
33Provability of the pigeonhole principle and the existence of infinitely many primesJournal of Symbolic Logic 53 (4): 1235-1244. 1988.
-
35The Type Theoretic Interpretation of Constructive Set TheoryJournal of Symbolic Logic 49 (1): 313-314. 1984.
-
The Finite Values PropertyIn Beierle C., Brewka C. & Thimm M. (eds.), Computational Models of Rationality, Essays Dedicated to Gabriele Kern-Isberner on the Occasion of her 60th Birthday, College Publications. pp. 316-331. 2016.We argue that the simplicity condition on a probability function on sentences of a predicate language L that it takes only finitely many values on the sentences of any finite sublanguage of L can be viewed as rational. We then go on to investigate consequences of this condition, linking it to the model theoretic notion of quantifier elimination.
-
98Common sense and maximum entropySynthese 117 (1): 75-93. 1998.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 a…Read more
-
72A Note on Binary Inductive LogicJournal of Philosophical Logic 36 (6): 735-771. 2007.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.
-
31The Twin Continua of Inductive MethodsIn Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics, De Gruyter. pp. 355-366. 2015.
-
65Rationality As ConformitySynthese 144 (2): 249-285. 2005.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.
-
2Review: K. McAloon, Modeles de l'arithmetique, Siminaire Paris VII (review)Journal of Symbolic Logic 48 (2): 483-484. 1983.
-
69A new criterion for comparing fuzzy logics for uncertain reasoningJournal of Logic, Language and Information 9 (1): 31-63. 2000.A new criterion is introduced for judging the suitability of various fuzzy logics for practical uncertain reasoning in a probabilistic world and the relationship of this criterion to several established criteria, and its consequences for truth functional belief, are investigated
-
395An observation on Carnapʼs Continuum and stochastic independenciesJournal of Applied Logic 11 (4): 421-429. 2013.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 lan…Read more
-
30Subsets of models of arithmeticArchive for Mathematical Logic 32 (1): 65-73. 1992.We define certain properties of subsets of models of arithmetic related to their codability in end extensions and elementary end extensions. We characterize these properties using some more familiar notions concerning cuts in models of arithmetic
-
44The uncertain reasoner's companion: a mathematical perspectiveCambridge University Press. 1994.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 concentra…Read more
-
88Some observations on induction in predicate probabilistic reasoningJournal of Philosophical Logic 31 (1): 43-75. 2002.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
-
11Principles of uncertain reasoningIn and J. Larrazabal J. Ezquerro A. Clark (ed.), Philosophy and Cognitive Science: Categories, Consciousness, and Reasoning, Kluwer Academic Publishers. pp. 221--259. 1996.
-
38Truth definitions without exponentiation and the Σ₁ collection schemeJournal of Symbolic Logic 77 (2): 649-655. 2012.We prove that: • if there is a model of I∆₀ + ¬ exp with cofinal Σ₁-definable elements and a Σ₁ truth definition for Σ₁ sentences, then I∆₀ + ¬ exp +¬BΣ₁ is consistent, • there is a model of I∆₀ Ω₁ + ¬ exp with cofinal Σ₁-definable elements, both a Σ₂ and a ∏₂ truth definition for Σ₁ sentences, and for each n > 2, a Σ n truth definition for Σ n sentences. The latter result is obtained by constructing a model with a recursive truth-preserving translation of Σ₁ sentences into boolean combinations …Read more
-
Predicate Exchangeability and Language Invariance in Pure Inductive LogicLogique Et Analyse 57 (228): 513-540. 2014.In Pure Inductive Logic, the rational principle of Predicate Exchangeability states that permuting the predicates in a given language L and replacing each occurrence of a predicate in an L-sentence phi according to this permutation should not change our belief in the truth of phi. In this paper we study when a prior probability function w on a purely unary language L satisfying Predicate Exchangeability also satisfies the principle of Unary Language Invariance.
-
10Common sense and stochastic independenceIn David Corfield & Jon Williamson (eds.), Foundations of Bayesianism, Kluwer Academic Publishers. pp. 203--240. 2001.
-
55Atom Exchangeability and Instantial RelevanceJournal of Philosophical Logic 38 (3): 313-332. 2009.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.
-
57On the scheme of induction for bounded arithmetic formulasAnnals of Pure and Applied Logic 35 (C): 261-302. 1987.
-
74Symmetry in Polyadic Inductive LogicJournal of Logic, Language and Information 21 (2): 189-216. 2012.A family of symmetries of polyadic inductive logic are described which in turn give rise to the purportedly rational Permutation Invariance Principle stating that a rational assignment of probabilities should respect these symmetries. An equivalent, and more practical, version of this principle is then derived
-
10A property of 2‐sorted peano models and program verificationMathematical Logic Quarterly 30 (19‐24): 325-334. 1984.
-
55O is not enoughReview 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
-
10Pure Inductive LogicCambridge 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.
-
University of ManchesterRegular Faculty
Areas of Interest
Logic and Philosophy of Logic |
Philosophy of Probability |