Indecomposability (intuitionistic logic)

This definition may be confusing or unclear to readers. Please help clarify the definition. There might be a discussion about this on the talk page. (November 2017) (Learn how and when to remove this message)

In intuitionistic analysis and in computable analysis, indecomposability or indivisibility (German: Unzerlegbarkeit, from the adjective unzerlegbar) is the principle that the continuum cannot be partitioned into two nonempty pieces. This principle was established by Brouwer in 1928^[1] using intuitionistic principles, and can also be proven using Church's thesis. The analogous property in classical analysis is the fact that every continuous function from the continuum to {0,1} is constant.

It follows from the indecomposability principle that any property of real numbers that is decided (each real number either has or does not have that property) is in fact trivial (either all the real numbers have that property, or else none of them do). Conversely, if a property of real numbers is not trivial, then the property is not decided for all real numbers. This contradicts the law of the excluded middle, according to which every property of the real numbers is decided; so, since there are many nontrivial properties, there are many nontrivial partitions of the continuum.

In constructive set theory (CZF), it is consistent to assume the universe of all sets is indecomposable—so that any class for which membership is decided (every set is either a member of the class, or else not a member of the class) is either empty or the entire universe.

• Indecomposable continuum

• Dalen, Dirk van (1997). "How Connected is the Intuitionistic Continuum?". The Journal of Symbolic Logic. 62 (4): 1147–1150. doi:10.2307/2275631. JSTOR 2275631. S2CID 7335245.
• Kleene, Stephen Cole; Vesley, Richard Eugene (1965). The Foundations of Intuitionistic Mathematics. North-Holland. p. 155.
• Rathjen, Michael (2010). "Metamathematical Properties of Intuitionistic Set Theories with Choice Principles" (PDF). In Cooper; Löwe; Sorbi (eds.). New Computational Paradigms. New York: Springer. ISBN 9781441922632. Archived from the original (PDF) on 2011-05-19. Retrieved 2008-05-14.