• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Matematisk institutt
  • Matematisk institutt
  • View Item
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Matematisk institutt
  • Matematisk institutt
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Continuity, proof systems and the theory of transfinite computations

Normann, Dag
Research report
View/Open
pm19-96.pdf (448.8Kb)
Year
1996
Permanent link
http://urn.nb.no/URN:NBN:no-28181

Is part of
Preprint series. Pure mathematics
Metadata
Show metadata
Appears in the following Collection
  • Matematisk institutt [1973]
Abstract
We use domains with totality, density and co-density to define transfinite proof-systems, generalising omega-logic and in some sense, the beta-logic of Girard. We prove a cut elimination theorem for these logical systems. The main application is the developement of E-logic, a transfinite proof systems for recursion in the functional ^3E.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisTemplatesAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login

Statistics

View Usage Statistics
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy