An algebraic version of the Strong Black Box

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/65

Full metadata record

DC Field	Value	Language
dc.contributor.author	Göbel, Rüdiger	-
dc.contributor.author	Wallutis, Simone L.	-
dc.date.accessioned	2015-10-20T12:06:53Z	-
dc.date.available	2015-10-20T12:06:53Z	-
dc.date.issued	2003-05-23	-
dc.identifier.uri	http://hdl.handle.net/123456789/65	-
dc.description	Various versions of the prediction principle called the “Black Box” are known. One of the strongest versions can be found in [EM]. There it is formulated and proven in a model theoretic way. In order to apply it to specific algebraic problems it thus has to be transformed into the desired algebraic setting. This requires intimate knowledge on model theory which often pre- vents algebraists to use this powerful tool. Hence we here want to present algebraic versions of this “Strong Black Box” in order to demonstrate that the proofs are straightforward and that it is easy enough to change the setting without causing major changes in the relevant proofs. This shall be done by considering three different applications where the obtained results are actually known.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Луганский национальный университет им. Т. Шевченко	uk_UA
dc.title	An algebraic version of the Strong Black Box	uk_UA
dc.type	Article	uk_UA
Appears in Collections:	Статті

Files in This Item:

File	Description	Size	Format
adm-n3-2.pdf		392.78 kB	Adobe PDF	View/Open

DSpace JSPUI