Results

eNauka >  Results >  Countable models of trivial theories which admit finite coding
Title: Countable models of trivial theories which admit finite coding
Authors: Loveys, James; Tanović, Predrag  
Issue Date: 1996
Publication: Journal of Symbolic Logic
ISSN: 0022-4812 Journal of Symbolic Logic Search Idenfier
Publisher: Cambridge University Press
Type: Article
Collation: vol. 61 br. 4 str. 1279-1286
DOI: 10.2307/2275816
WoS-ID: A1996WF13000010
Scopus-ID: 2-s2.0-0030300456
URI: http://researchrepository.mi.sanu.ac.rs/handle/123456789/2770
https://enauka.gov.rs/handle/123456789/579471
M-category: 
Mp. category will be shown later

3
SCOPUSTM
2
OpenCitations
2
WEB OF SCIENCETM
Altmetric
Dimensions

Find the DOI

Unpaywall

Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.