It is argued that the truth status of emergent properties of complex adaptive systems models should be based on an epistemology of proof by constructive verification and therefore on the ontological axioms of a non-realist logical system such as constructivism or intuitionism. ‘Emergent’ properties of complex adaptive systems (CAS) models create particular epistemological and ontological challenges. These challenges bear directly on current debates in the philosophy of mathematics and in theoretical computer science. CAS research, with its emphasis on computer simulation, is heavily reliant on models which explore the entailments of Formal Axiomatic Systems (FAS). The incompleteness results of G¨odel, the incomputability results of Turing, and the Algorithmic Information Theory results of Chaitin, undermine a realist (platonic) truth model of emergent properties. These same findings support the hegemony of epistemology over ontology and point to alternative truth models such as intuitionism, constructivism and quasi-empiricism.
[1]
E. Snapper.
What do we do when we do mathematics?
,
1988
.
[2]
Stephan Korner,et al.
The philosophy of mathematics
,
1961
.
[3]
G. Chaitin.
Randomness in arithmetic and the decline and fall of reductionism in pure mathematics
,
1993,
chao-dyn/9304002.
[4]
Robert C. Moore.
Semantical Considerations on Nonmonotonic Logic
,
1985,
IJCAI.
[5]
Gregory J. Chaitin,et al.
Algorithmic Information Theory
,
1987,
IBM J. Res. Dev..
[6]
Bruce Edmonds,et al.
SDML: A Multi-Agent Language for Organizational Modelling
,
1998,
Comput. Math. Organ. Theory.
[7]
Gregory J. Chaitin.
Two Philosophical Applications of Algorithmic Information Theory
,
2003,
DMTCS.