"The family of languages satisfying "Bar-Hillel's" lemma."

Sándor Horváth (1978)

> Home

Details and statistics

DOI: 10.1051/ITA/1978120301931

access: closed

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/Horvath78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/Horvath78
Sándor Horváth:
The family of languages satisfying "Bar-Hillel's" lemma. RAIRO Theor. Informatics Appl. 12(3): 193-199 (1978)

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.