Abstract
The goal of this paper is to use an artificial context of reduction of one world to another to illustrate two pheonomena which have so far not been described as types of failure of reductionist methodology.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K.R. Apt & G.D. Plotkin, Countable nondeterminism and random assignment.Journal of the ACM, 33 (1986).
J.D. Brock & W.B. Ackerman, Scenarios: a model of non-deterministic computations.Lecture Notes in Computer Science vol. 107. Springer Verlag, 1981.
A. Stoughton, Fufly Abstract Models of Programming Languages . Pitman Publ. Co., London, 1988.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Engeler, E. (1991). The Technical Problem of “Full Abstractness” as a Model for an Issue in Reductionism. In: Agazzi, E. (eds) The Problem of Reductionism in Science. Episteme, vol 18. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3492-7_5
Download citation
DOI: https://doi.org/10.1007/978-94-011-3492-7_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5544-4
Online ISBN: 978-94-011-3492-7
eBook Packages: Springer Book Archive