•  12
    Gödels disjunctie
    Tijdschrift Voor Filosofie 60 (1). 1998.
    In his Gibbs lecture, Gödel argued for the thesis that either the human mind is not a Turing machine, or there exist absolutely undecidable mathematical propositions. He believed that this disjunction can be deduced with mathematical certainty from certain results in mathematical logic. He thought that his disjunctive thesis is of great philosophical importance. First, Gödel's argument for his disjunctive thesis is discussed. It is argued that thisargument contains an ambiguity. But when it is m…Read more
  •  237
    Reflecting in epistemic arithmetic
    Journal of Symbolic Logic 61 (3): 788-801. 1996.
    An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation
  •  8
    `Contemporary Methods for Investigating the Concept of Truth – An Introduction'
    In Leon Horsten & Volker Halbach (eds.), Principles of Truth, De Gruyter. pp. 11-36. 2003.
  •  4
    Preface
    In Leon Horsten & Volker Halbach (eds.), Principles of Truth, De Gruyter. pp. 7-8. 2003.
  •  25
    Two Proof-Theoretic Remarks on EA + ECT
    Mathematical Logic Quarterly 46 (4): 461-466. 2000.
    In this note two propositions about the epistemic formalization of Church's Thesis are proved. First it is shown that all arithmetical sentences deducible in Shapiro's system EA of Epistemic Arithmetic from ECT are derivable from Peano Arithmetic PA + uniform reflection for PA. Second it is shown that the system EA + ECT has the epistemic disjunction property and the epistemic numerical existence property for arithmetical formulas
  •  55
    In this contribution, we focus on probabilistic problems with a denumerably or non-denumerably infinite number of possible outcomes. Kolmogorov (1933) provided an axiomatic basis for probability theory, presented as a part of measure theory, which is a branch of standard analysis or calculus. Since standard analysis does not allow for non-Archimedean quantities (i.e. infinitesimals), we may call Kolmogorov's approach "Archimedean probability theory". We show that allowing non-Archimedean probabi…Read more
  •  136
    This paper investigates the role of pictures in mathematics in the particular case of Cayley graphs—the graphic representations of groups. I shall argue that their principal function in that theory—to provide insight into the abstract structure of groups—is performed employing their visual aspect. I suggest that the application of a visual graph theory in the purely non-visual theory of groups resulted in a new effective approach in which pictures have an essential role. Cayley graphs were initi…Read more
  • Hellman, G., Mathematics without Numbers. Towards a Modal-Structural Interpretation (review)
    Tijdschrift Voor Filosofie 53 (4): 726. 1991.
  •  110
    Revision Revisited
    with Graham E. Leigh, Hannes Leitgeb, and Philip Welch
    Review of Symbolic Logic 5 (4): 642-664. 2012.
    This article explores ways in which the Revision Theory of Truth can be expressed in the object language. In particular, we investigate the extent to which semantic deficiency, stable truth, and nearly stable truth can be so expressed, and we study different axiomatic systems for the Revision Theory of Truth.
  •  2
    Eindig, oneindig, meer dan oneindig. Grondslagen van de wiskundige wetenschappen
    Tijdschrift Voor Filosofie 67 (1): 175-177. 2005.