View in EDS

A termination proof for epsilon substitution using partial derivations

Saved in:
Bibliographic Details
Title: A termination proof for epsilon substitution using partial derivations
Authors: Mints, G.1 mints@turing.stanford.edu
Source: Theoretical Computer Science. Jun2003, Vol. 303 Issue 1, p187. 27p.
Subjects: Stochastic convergence, Approximation theory
Abstract: Epsilon substitution method introduced by Hilbert is a successive approximation process providing numerical realizations from proofs of existential formulas. Most convergence (termination) proofs for it use assignments of decreasing ordinals to stages of the process and work only for predicative systems. We describe a new ordinal assignment for the case of first-order arithmetic admitting extension to impredicative systems. It is based on an interpretation of individual epsilon substitutions forming the substitution process as incomplete finite proofs, each encoding a complete but infinite proof. [Copyright &y& Elsevier]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 10009379
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A termination proof for epsilon substitution using partial derivations
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Mints%2C+G%2E%22">Mints, G.</searchLink><relatesTo>1</relatesTo><i> mints@turing.stanford.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Jun2003, Vol. 303 Issue 1, p187. 27p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Stochastic+convergence%22">Stochastic convergence</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+theory%22">Approximation theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Epsilon substitution method introduced by Hilbert is a successive approximation process providing numerical realizations from proofs of existential formulas. Most convergence (termination) proofs for it use assignments of decreasing ordinals to stages of the process and work only for predicative systems. We describe a new ordinal assignment for the case of first-order arithmetic admitting extension to impredicative systems. It is based on an interpretation of individual epsilon substitutions forming the substitution process as incomplete finite proofs, each encoding a complete but infinite proof. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=10009379
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/S0304-3975(02)00451-6
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 27
        StartPage: 187
    Subjects:
      – SubjectFull: Stochastic convergence
        Type: general
      – SubjectFull: Approximation theory
        Type: general
    Titles:
      – TitleFull: A termination proof for epsilon substitution using partial derivations
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Mints, G.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 28
              M: 06
              Text: Jun2003
              Type: published
              Y: 2003
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 303
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1