Countable models of trivial theories which admit finite coding (Q3128473): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2275816 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075192103 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994342 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finitely based theories / rank | |||
Normal rank | |||
Latest revision as of 11:10, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Countable models of trivial theories which admit finite coding |
scientific article |
Statements
Countable models of trivial theories which admit finite coding (English)
0 references
20 August 1997
0 references
trivial theory
0 references
finite coding
0 references
stable theory
0 references
countable models
0 references
Vaught's conjecture
0 references
symmetry lemma
0 references
superstable type
0 references
