This paper presents Automath encodings (which are also valid in LF/λP ) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to find out which foundation is the simplest. The systems analyzed in this way are two kinds of set theory (ZFC and NF),
✦ LIBER ✦
COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
✍ Scribed by LÖFGREN, LARS
- Book ID
- 115484067
- Publisher
- Taylor and Francis Group
- Year
- 1977
- Tongue
- English
- Weight
- 1022 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0308-1079
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Is ZF a hack?: Comparing the complexity
✍
Freek Wiedijk
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 315 KB
Foundations of Complex-Systems Theories
✍
Martin H. Krieger
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 46 KB
On irreducible description of complex sy
✍
Victor Korotkikh; Galina Korotkikh
📂
Article
📅
2009
🏛
John Wiley and Sons
🌐
English
⚖ 249 KB
## Abstract The aim of the article is to present the description of complex systems in terms of self‐organization processes of prime integer relations and illustrate its main properties. Based on the integers and controlled by arithmetic only, the processes can characterize complex systems by infor
On the complexity of induction of struct
✍
Xuemiao Lu
📂
Article
📅
1987
🏛
Springer
🌐
English
⚖ 565 KB
Formal description of interaction betwee
✍
N. P. Buslenko; A. N. Averkin
📂
Article
📅
1974
🏛
Springer US
🌐
English
⚖ 691 KB
Transformations of descriptions of nonli
✍
A. P. Krishchenko; V. N. Chetverikov
📂
Article
📅
2009
🏛
Springer
🌐
English
⚖ 381 KB