On , declare when their symmetric difference is finite. Use the well-ordering theorem to choose one representative from each equivalence class, and color by
Removing one point from a countably infinite set does not change its equivalence class and reverses this parity. For any of order type and , both and belong to and receive different colors. There is no homogeneous of order type . This proves the negative infinite-arity partition relation
The slashed arrow in the PDF is essential.
Use the countable-language hypothesis of the omitting types theorem, which is the usual convention for this prime-model result. Let be a prime model of and .
First, is complete up to logical consequence: every model receives an elementary embedding of , so it satisfies exactly the same sentences as . We may therefore replace by without changing its model class or the prime model property.
Suppose were not isolated. The omitting types theorem, applied to this single complete type, would produce omitting . By primality choose an elementary embedding . For every ,
Then realizes , contradicting omission. Consequently
The same proof applies to every finite tuple, giving an atomic model. Countability of the language is a hypothesis of this argument, not a restriction on parameter sets in the separate parts (a) and (d). The PDF does not state that standing hypothesis explicitly; it must be included when invoking this version of the theorem.
Let be an isolated type over , with isolating formula over . Its consistency with and the complete theory property imply
otherwise would belong to , contradicting consistency. Choose a tuple satisfying . By isolation,
so satisfies every member of . Therefore every isolated A-type is realized in the original structure. The same reasoning works for a principal partial type whose isolating formula need not itself be a member of the type.
A precise countable-language form of the omitting types theorem is the following. Let be a consistent first-order theory in a countable first-order language, and let be a countable family of nonprincipal partial types, each in finitely many variables. Then there is a finite or countably infinite model of omitting all the .
A partial type is a set of formulas jointly consistent with . It is principal if there is a formula such that is consistent and
For a complete type, this is exactly being an isolated type. Nonprincipal means that no such formula exists. A model omits if no tuple in that model satisfies every formula in ; different tuples may fail different members of the type. The model in the theorem need not omit each individual formula everywhere.
For parameter types, use the expanded language naming the parameters. Countability then applies to that expanded language, and hence requires a countable parameter set as well. There is no countability restriction in the finite-satisfiability argument of part (a).
The Stone topology on a type space has basic open sets
where ranges over formulas with parameters in and free variables. Here points are complete types consistent with . Arbitrary open sets are unions of these basic sets.
The identities
show that the basic sets are clopen sets and form a basis. Distinct complete types contain opposite choices for some formula, so this topology is Hausdorff. The compactness theorem gives compactness: a family of basic closed sets with the finite intersection property determines a consistent set of formulas, which extends to a complete type. Thus logical formulas provide a basis of clopen tests for distinguishing points of the type space.
Expand the language by constants for and write . An A-type over a structure is a set of formulas in a fixed finite tuple , with parameters from , consistent with this complete theory.
Let . If no tuple of realized , then
That sentence belongs to and contradicts the consistency of . Consequently
For , any tuple works because domains are nonempty. This proves finite satisfiability; realization of the entire partial type may require an elementary extension.
Suppose first that is a bisimulation containing the root pair. II maintains the invariant that the current pair lies in . If I moves in the first rooted directed graph, the forth clause supplies a matching successor in the second; if I moves in the second, the back clause supplies a matching successor in the first. II can choose such a response every time I can move. Therefore II never loses after finitely many steps and wins the bisimulation game.
Conversely, let be a winning strategy for II. Define to consist of all endpoint pairs of finite legal plays starting at the roots and consistent with , including the initial root pair. This definition keeps every possible history; it does not assume that depends only on the current position.
Take and a finite history realizing it. For any successor of , extend that history by having I choose the edge . Since is winning, it supplies a successor of . The new endpoint pair belongs to , proving forth. Letting I choose any successor of proves back in the same way. Hence is a bisimulation and
Connectedness ensures that both projections of cover all vertices: I can walk any finite directed path from either root and II's strategy supplies the matching path. The equivalence itself only concerns the rooted reachable behaviour and remains valid without connectedness.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact