ISBN: 9786131156991 - saturated model: mathematical logic, model theory, type, finite set, infinite, cardinal number (4 Ergebnisse)

- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 34,00
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! In mathematical logic, and particularly in its subfield model theory, a saturated model M is one which realizes as many complete types as may be 'reasonably expected' given its size.Let be a finite or infinite cardinal number and M a model in some first-order language. Then M is called -saturated if for all subsets A M of cardinality less than , M realizes all complete types over A. The model M is called saturated if it is M -saturated where M denotes the cardinality of M. That is, it realizes all complete types over sets of parameters of size less than M . According to some authors, a model M is called countably saturated if it is aleph_1-saturated; that is, it realizes all complete types over countable sets of parameters. According to others, it is countably saturated if it is aleph_0-saturated; i.e. realizes all complete types over finite parameter sets. 96 pp. Englisch.…

- Softcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 42,20
EUR 35,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In mathematical logic, and particularly in its subfield model theory, a saturated model M is one which realizes as many complete types as may be 'reasonably expected' given its size.Let be a finite or infinite cardinal number and M a model in some first-order language. Then M is called -saturated if for all subsets A M of cardinality less than , M realizes all complete types over A. The model M is called saturated if it is M -saturated where M denotes the cardinality of M. That is, it realizes all complete types over sets of parameters of size less than M . According to some authors, a model M is called countably saturated if it is aleph_1-saturated; that is, it realizes all complete types over countable sets of parameters. According to others, it is countably saturated if it is aleph_0-saturated; i.e. realizes all complete types over finite parameter sets.…

- Softcover
- Print-on-Demand
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 109,85
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Saturated Model | Mathematical Logic, Model Theory, Type, Finite Set, Infinite, Cardinal Number | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131156991 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. …

- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 136,00
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In mathematicallogic, and particularly in its subfield model theory, a saturated modelM is one which realizes as many complete types as may be 'reasonablyexpected' given its size.Let ¿ be a finite or infinite cardinal numberand M a model in some first-order language. Then M is called ¿-saturatedif for all subsets A ¿ M of cardinality less than ¿, M realizes allcomplete types over A. The model M is called saturated if it is|M|-saturated where |M| denotes the cardinality of M. That is, itrealizes all complete types over sets of parameters of size less than|M|. According to some authors, a model M is called countably saturatedif it is aleph_1-saturated; that is, it realizes all complete types overcountable sets of parameters. According to others, it is countablysaturated if it is aleph_0-saturated; i.e. realizes all complete typesover finite parameter sets.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 96 pp. Englisch.…