Learn More
There are structures A which can be described up to isomorphism by a single sentence φ (in some logic), that is, B |= φ ⇐⇒ B ∼= A for all B. If the structure A is finite, then φ can be taken as a(More)