•  942
    An observation on Carnapʼs Continuum and stochastic independencies
    Journal 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
  •  214
    Some independence results for peano arithmetic
    Journal of Symbolic Logic 43 (4): 725-731. 1978.
  •  189
    Common sense and maximum entropy
    Synthese 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
  •  76
    Subsets of models of arithmetic
    Archive 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
  •  115
    Truth definitions without exponentiation and the Σ₁ collection scheme
    with Zofia Adamowicz and Leszek Aleksander Kołodziejczyk
    Journal 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 Logic
    with M. S. Kliess
    Logique 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.
  •  107
    On the scheme of induction for bounded arithmetic formulas
    with A. J. Wilkie
    Annals of Pure and Applied Logic 35 (C): 261-302. 1987.
  •  133
    On LP -models of arithmetic
    with A. Sirokofskich
    Journal of Symbolic Logic 73 (1): 212-226. 2008.
    We answer some problems set by Priest in [11] and [12], in particular refuting Priest's Conjecture that all LP-models of Th(N) essentially arise via congruence relations on classical models of Th(N). We also show that the analogue of Priest's Conjecture for I δ₀ + Exp implies the existence of truth definitions for intervals [0,a] ⊂ₑ M ⊨ I δ₀ + Exp in any cut [0,a] ⊂e K ⊆ M closed under successor and multiplication
  •  171
    A Note on Priest's Finite Inconsistent Arithmetics
    with N. Pathmanathan
    Journal 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