297 research outputs found

    Provenance of north Gondwana Cambrian-Ordovician sandstone: U-Pb SHRIMP dating of detrital zircons from Israel and Jordan

    Get PDF
    A vast sequence of quartz-rich sandstone was deposited over North Africa and Arabia during Early Palaeozoic times, in the aftermath of Neoproterozoic Pan-African orogeny and the amalgamation of Gondwana. This rock sequence forms a relatively thin sheet (1–3 km thick) that was transported over a very gentle slope and deposited over a huge area. The sense of transport indicates unroofing of Gondwana terranes but the exact provenance of the siliciclastic deposit remains unclear. Detrital zircons from Cambrian arkoses that immediately overlie the Neoproterozoic Arabian–Nubian Shield in Israel and Jordan yielded Neoproterozoic U–Pb ages (900–530 Ma), suggesting derivation from a proximal source such as the Arabian–Nubian Shield. A minor fraction of earliest Neoproterozoic and older age zircons was also detected. Upward in the section, the proportion of old zircons increases and reaches a maximum (40%) in the Ordovician strata of Jordan. The major earliest Neoproterozoic and older age groups detected are 0.95–1.1, 1.8–1.9 and 2.65–2.7 Ga, among which the 0.95–1.1 Ga group is ubiquitous and makes up as much as 27% in the Ordovician of Jordan, indicating it is a prominent component of the detrital zircon age spectra of northeast Gondwana. The pattern of zircon ages obtained in the present work reflects progressive blanketing of the northern Arabian–Nubian Shield by Cambrian–Ordovician sediments and an increasing contribution from a more distal source, possibly south of the Arabian–Nubian Shield. The significant changes in the zircon age signal reflect many hundreds of kilometres of southward migration of the provenance

    On the alleged simplicity of impure proof

    Get PDF
    Roughly, a proof of a theorem, is “pure” if it draws only on what is “close” or “intrinsic” to that theorem. Mathematicians employ a variety of terms to identify pure proofs, saying that a pure proof is one that avoids what is “extrinsic,” “extraneous,” “distant,” “remote,” “alien,” or “foreign” to the problem or theorem under investigation. In the background of these attributions is the view that there is a distance measure (or a variety of such measures) between mathematical statements and proofs. Mathematicians have paid little attention to specifying such distance measures precisely because in practice certain methods of proof have seemed self- evidently impure by design: think for instance of analytic geometry and analytic number theory. By contrast, mathematicians have paid considerable attention to whether such impurities are a good thing or to be avoided, and some have claimed that they are valuable because generally impure proofs are simpler than pure proofs. This article is an investigation of this claim, formulated more precisely by proof- theoretic means. After assembling evidence from proof theory that may be thought to support this claim, we will argue that on the contrary this evidence does not support the claim

    The Epsilon Calculus and Herbrand Complexity

    Get PDF
    Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator ϵx\epsilon_{x}. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential theorems obtained by this elimination procedure.Comment: 23 p

    From Euclidean Geometry to Knots and Nets

    Get PDF
    This document is the Accepted Manuscript of an article accepted for publication in Synthese. Under embargo until 19 September 2018. The final publication is available at Springer via https://doi.org/10.1007/s11229-017-1558-x.This paper assumes the success of arguments against the view that informal mathematical proofs secure rational conviction in virtue of their relations with corresponding formal derivations. This assumption entails a need for an alternative account of the logic of informal mathematical proofs. Following examination of case studies by Manders, De Toffoli and Giardino, Leitgeb, Feferman and others, this paper proposes a framework for analysing those informal proofs that appeal to the perception or modification of diagrams or to the inspection or imaginative manipulation of mental models of mathematical phenomena. Proofs relying on diagrams can be rigorous if (a) it is easy to draw a diagram that shares or otherwise indicates the structure of the mathematical object, (b) the information thus displayed is not metrical and (c) it is possible to put the inferences into systematic mathematical relation with other mathematical inferential practices. Proofs that appeal to mental models can be rigorous if the mental models can be externalised as diagrammatic practice that satisfies these three conditions.Peer reviewe

    Interactive Learning-Based Realizability for Heyting Arithmetic with EM1

    Full text link
    We apply to the semantics of Arithmetic the idea of ``finite approximation'' used to provide computational interpretations of Herbrand's Theorem, and we interpret classical proofs as constructive proofs (with constructive rules for ,\vee, \exists) over a suitable structure \StructureN for the language of natural numbers and maps of G\"odel's system \SystemT. We introduce a new Realizability semantics we call ``Interactive learning-based Realizability'', for Heyting Arithmetic plus \EM_1 (Excluded middle axiom restricted to Σ10\Sigma^0_1 formulas). Individuals of \StructureN evolve with time, and realizers may ``interact'' with them, by influencing their evolution. We build our semantics over Avigad's fixed point result, but the same semantics may be defined over different constructive interpretations of classical arithmetic (Berardi and de' Liguoro use continuations). Our notion of realizability extends intuitionistic realizability and differs from it only in the atomic case: we interpret atomic realizers as ``learning agents''

    Computational interpretations of analysis via products of selection functions

    Get PDF
    We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to two closely related infinite products of selection functions

    The "Artificial Mathematician" Objection: Exploring the (Im)possibility of Automating Mathematical Understanding

    Get PDF
    Reuben Hersh confided to us that, about forty years ago, the late Paul Cohen predicted to him that at some unspecified point in the future, mathematicians would be replaced by computers. Rather than focus on computers replacing mathematicians, however, our aim is to consider the (im)possibility of human mathematicians being joined by “artificial mathematicians” in the proving practice—not just as a method of inquiry but as a fellow inquirer

    On the computational content of Zorn's lemma

    Full text link
    We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is achieved through G\"odel's functional interpretation, and requires the introduction of a novel form of recursion over non-wellfounded partial orders whose existence in the model of total continuous functionals is proven using domain theoretic techniques. We show that a realizer for the functional interpretation of open induction over the lexicographic ordering on sequences follows as a simple application of our main results

    A Burgessian critique of nominalistic tendencies in contemporary mathematics and its historiography

    Full text link
    We analyze the developments in mathematical rigor from the viewpoint of a Burgessian critique of nominalistic reconstructions. We apply such a critique to the reconstruction of infinitesimal analysis accomplished through the efforts of Cantor, Dedekind, and Weierstrass; to the reconstruction of Cauchy's foundational work associated with the work of Boyer and Grabiner; and to Bishop's constructivist reconstruction of classical analysis. We examine the effects of a nominalist disposition on historiography, teaching, and research.Comment: 57 pages; 3 figures. Corrected misprint
    corecore