"Arithmetic complexity of the predicate logics of certain complete ..."

Valery Plisko (2001)

> Home

Details and statistics

DOI: 10.1016/S0168-0072(01)00061-6

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/Plisko01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/Plisko01
Valery Plisko:
Arithmetic complexity of the predicate logics of certain complete arithmetic theories. Ann. Pure Appl. Log. 113(1-3): 243-259 (2001)

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.