-
24Reasoning by analogy in inductive logicIn Michal Peliš & Vít Punčochář (eds.), The Logica Yearbook, College Publications. pp. 63--76. 2011.
-
107On the scheme of induction for bounded arithmetic formulasAnnals of Pure and Applied Logic 35 (C): 261-302. 1987.
-
121Proof 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
-
147Provability of the pigeonhole principle and the existence of infinitely many primesJournal of Symbolic Logic 53 (4): 1235-1244. 1988.
-
60Translation Invariance and Miller’s Weather ExampleJournal of Logic, Language and Information 28 (4): 489-514. 2019.In his 1974 paper “Popper’s qualitative theory of verisimilitude” published in the British Journal for the Philosophy of Science David Miller gave his so called ‘Weather Example’ to argue that the Hamming distance between constituents is flawed as a measure of proximity to truth since the former is not, unlike the latter, translation invariant. In this present paper we generalise David Miller’s Weather Example in both the unary and polyadic cases, characterising precisely which permutations of c…Read more
-
89Six Problems in Pure Inductive LogicJournal of Philosophical Logic 48 (4): 731-747. 2019.We present six significant open problems in Pure Inductive Logic, together with their background and current status, with the intention of raising awareness and leading ultimately to their resolution.
-
171A Note on Priest's Finite Inconsistent ArithmeticsJournal of Philosophical Logic 35 (5): 529-537. 2006.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
-
202A 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.
-
40Asymptotic conditional probabilities for binary probability functionsAnnals of Pure and Applied Logic 175 (9): 103335. 2024.