[permalink] [id link]
** MSX BASIC V4. 0 ( 16 KB )
from
Wikipedia
Some Related Sentences
** and MSX
** Yamaha YM2149, used in the Atari ST, MSX, Intellivision, Amstrad CPC, and ZX Spectrum computers ( same as General Instrument AY-3-8910 )
** Yamaha YM2413 ( a. k. a. OPLL ), used in MSX in MSX Music cartridges like the FM-PAC and internally in several Japanese models by Panasonic, Sony and Sanyo ; also used in Sega Mark III ( Japanese version of Master System )
** Yamaha YM2151 ( a. k. a. OPM ), used in Sharp X68000 and the Yamaha SFG-01 and SFG-05 FM Sound Synthesizer Unit cartridges for MSX
** and BASIC
** Microsoft BASIC Home Computer Module ( G7420 ) – Similar to above, with the purpose of converting the G7400 into a " real " computer, not compatible with G7000.
** and .
** Eunectes murinus, the green anaconda, the largest species, is found east of the Andes in Colombia, Venezuela, the Guianas, Ecuador, Peru, Bolivia, Brazil and on the island of Trinidad.
** Eunectes notaeus, the yellow anaconda, a smaller species, is found in eastern Bolivia, southern Brazil, Paraguay and northeastern Argentina.
** Eunectes deschauenseei, the dark-spotted anaconda, is a rare species found in northeastern Brazil and coastal French Guiana.
** Eunectes beniensis, the Bolivian anaconda, the most recently defined species, is found in the Departments of Beni and Pando in Bolivia.
** Tarski's theorem: For every infinite set A, there is a bijective map between the sets A and A × A.
** Trichotomy: If two sets are given, then either they have the same cardinality, or one has a smaller cardinality than the other.
** König's theorem: Colloquially, the sum of a sequence of cardinals is strictly less than the product of a sequence of larger cardinals.
** Zorn's lemma: Every non-empty partially ordered set in which every chain ( i. e. totally ordered subset ) has an upper bound contains at least one maximal element.
** Hausdorff maximal principle: In any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset.
** Tukey's lemma: Every non-empty collection of finite character has a maximal element with respect to inclusion.
** In the product topology, the closure of a product of subsets is equal to the product of the closures.
** If S is a set of sentences of first-order logic and B is a consistent subset of S, then B is included in a set that is maximal among consistent subsets of S. The special case where S is the set of all first-order sentences in a given signature is weaker, equivalent to the Boolean prime ideal theorem ; see the section " Weaker forms " below.
0.205 seconds.