"Countable Models of Trivial Theories Which Admit Finite Coding."

James Loveys, Predrag Tanovic (1996)

> Home

Details and statistics

DOI: 10.2307/2275816

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/LoveysT96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/LoveysT96
James Loveys, Predrag Tanovic:
Countable Models of Trivial Theories Which Admit Finite Coding. J. Symb. Log. 61(4): 1279-1286 (1996)

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.