Search CurateND

Search criteria:

Clear all

List of files deposited in CurateND that match your search criteria

  • Author(s):
    Roy A. Clouser
    Subject(s):
    Reductionism, Science--Theory reduction, Philosophy and religion, Theory (Philosophy), Religion and science
    Abstract:

    Written for undergraduates, the educated layperson, and scholars in fields other than philosophy, The Myth of Religious Neutrality offers a radical reinterpretation of the general relations between religion, science, and philosophy. This new edition has been completely revised and updated by the author.

    © University of Notre Dame

    Copyright for most content is held by The University of Notre Dame. Reproduction of all or any portion of content constitutes a violation of copyright. You must …

    Date Published:
    2005-05-15
    Date Created:
    2016-03-15
    Record Visibility:
    Public
    Resource Type
    Book
  • Author(s):
    Robert John Russell
    Subject(s):
    Eschatology, Cosmology, Eternity, Space and time--Religious aspects--Christianity, Religion and science
    Abstract:

    According to Robert John Russell, one of the foremost scholars on relating Christian theology and science, the topic of “time and eternity” is central to the relation between God and the world in two ways. First, it involves the notion of the divine eternity as the supratemporal source of creaturely time. Second, it involves the eternity of the eschatological New Creation beginning with the bodily Resurrection of Jesus in relation to creaturely time. The key to Russell’s engagem…

    Date Published:
    2012-06-19
    Date Created:
    2016-03-15
    Record Visibility:
    Public
    Resource Type
    Book
  • Author:
    Dominic Leon Culver
    Advisory Committee:
    Mark Behrens
    Degree Area:
    Mathematics
    Degree:
    PhD
    Defense Date:
    2017-05-10
    Record Visibility:
    Public
  • Abstract:

    In 1845 Bertrand postulated that there is always a prime between $n$ and $2n$, and he verified this for $n < 3,000,000$. Tchebychev gave an analytic proof of the postulate in 1850. In 1932, in his first paper, Erdos gave a beautiful elementary proof using nothing more than a few easily verified facts about the middle binomial coefficient. We describe Erdos’s proof and make a few additional comments, including a discussion of how the two main lemmas used in the proof very quickly give a…

    Record Visibility:
    Public
    Resource Type
    Document
  • Author:
    John E. Derwent
    Degree Area:
    Mathematics
    Degree:
    PhD
    Defense Date:
    1963-06-14
    Record Visibility:
    Public
  • Author(s):
    mmontee
    Description:
    A construction of the Chern Classes of complex vector bundles via algebraic topology and classifying spaces.
    Record Visibility:
    Public
    Resource Type
    Senior Thesis
  • Author(s):
    mcharnle
    Description:
    This thesis has two parts. The first discusses the Laplacian and how to solve it in arbitrary domains. It will cover Dirichlet's Principle, the Fundamental Solution, and Green's Function, as well as examples on the half space and ball. The second will cover the inverse problem of detecting corrosion in a plate of metal using heat. It will discuss the general solution method, regularization of the solution, and analyze the results.
    Record Visibility:
    Public
    Resource Type
    Senior Thesis
  • Author(s):
    smeehan1
    Description:
    Ramsey theory studies conditions that are necessary so that we may preserve "order." Often, we will start with a large structure, and we will break it into finitely many classes. Our typical theorems will say that if the initial structure is large enough, then one of the classes must contain a copy of the original structure. Usually, we will find the smallest number of elements required so that this property is guaranteed to occur; this is often a difficult, but illuminating, problem.
    Record Visibility:
    Public
    Resource Type
    Senior Thesis
  • Author(s):
    Katherine Ritchey
    Description:
    When digital data is transmitted through an unreliable communication channel, it is often the case that errors can occur, causing the information received to differ from what was originally sent. Fortunately, there are ways to encode data so that errors can be detected and even corrected. This expository thesis focuses on a special class of codes, called linear codes, that have particularly nice properties that are useful for error detection and correction.
    Date Created:
    2013-04-01
    Record Visibility:
    Public
    Resource Type
    Senior Thesis
  • Author(s):
    mmontee
    Description:
    A construction of the Chern classes of complex vector bundles via algebraic topology and classifying spaces.
    Record Visibility:
    Public
    Resource Type
    Senior Thesis