Graph centered on Compactness theorem, showing the selected concept and its surrounding relations.Preparing the interactive atlas…

Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.

Curated starting points

Stories & Views

Relationship-aware analysis

Compare concepts

Choose two concepts to compare or connect.
Reading the graph

Guide to the Atlas

Canonical static concept record

Compactness theorem

Open this concept in the interactive graphRead the Markdown equivalent

Summary

A set of first-order sentences has a model whenever every finite subset has a model.

Record metadata

Carrier(s)

Axioms / constraints

Canonically induces

Notes

The statement is specific to first-order compactness; stronger logics can fail compactness.

Concept sources

Incoming relations (arrows to this concept)

Each relation below ends at this concept.

Gödel completeness theoremCompactness theorem

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

If an unsatisfiable theory entailed a contradiction, completeness would give a finite formal proof using only finitely many premises; contraposition yields compactness.

How to interpret this relation type

Record a genuine theorem implication that is not part of the target definition; these edges may point toward a weaker structure.

Relation sources

Outgoing relations (arrows from this concept)

Each relation below starts at this concept.

No direct relations are authored in this direction.