"Undecidable Complexity Statements in a Hierarchy of Extensions of ..."

Ron Sigal (1983)

> Home

Details and statistics

DOI: —

access: unavailable

type: Book or Thesis

metadata version: 2022-05-13

- no documents available
- export record
  dblp key:
  - phd/us/Sigal83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/us/Sigal83
Ron Sigal:
Undecidable Complexity Statements in a Hierarchy of Extensions of Primitive Recursive Arithmetic. New York University, USA, 1983

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.