# Why is compactness in logic called compactness?

In logic, a semiotics is claimed to be portable iff if every limited part of a set of sentences has a version, after that so to does the whole set.

The majority of logic messages either do not clarify the terminology, or mention the topological building of compactness. I see an example as, offered a topological room X and also a part of it S, S is portable iff for every single open cover of S, there is a limited subcover of S. But, it does not appear solid sufficient to warrant the terminology.

Exists even more to the selection of the terminology in logic than this example?

0
2019-05-04 07:38:55
Source Share

This isn't a full solution, partially due to the fact that I've had conversations with various other college student and also we weren't able to function it out sufficiently, yet I've been informed that you can in fact place a geography on sensible declarations such that the compactness theory converts to "The set of real declarations is a portable part of the set of all declarations" or something comparable. Yet as I claimed, a few of my close friends and also I weren't able to exercise the geography.

0
2019-05-08 02:34:25
Source

As much as I recognize, the link originates from the syntactic concept. You are offered a set of icons of sentence F = f_i and also you are permitted permitted to create intricate declarations utilizing them. You can incorporate the primary declarations with AND, OR, NOT drivers and also parentheses, in the common means.

So you get a set X of made up sentences, like

(f AND g) OR (NOT h)

or something like that.

A syntactic variation of the compactness theory mentions the adhering to.

Think that for every single limited part Y of X you can assign fact values to the f_i as if all sentences in Y hold true. Than you can do the very same for X.

Proof

Consider the topological room A gotten by taking the item of 0, 1 over the set F. The geography on A is the item geography. By Tychonoff's theory, A is portable. For every single made up declaration s, the set of fact values that make s real is a limited junction of cyndrical tubes, therefore it is a shut set of A. The theory claim that every limited junction of such shut collections, for s varying in X, is not vacant. Therefore the junction of all such shut set is not vacant, which suggests one can make all declarations in X real.

0
2019-05-08 02:27:14
Source

The example for the compactness theory for propositional calculus is as adheres to. Allow $p_i$ be propositional variables ; with each other, they take values in the item room $2^{\mathbb{N}}$. Intend we have a collection of declarations $S_t$ in these boolean variables such that every limited part is satisfiable. After that I assert that we can confirm that they are all concurrently satisfiable by utilizing a compactness argument.

Allow $F$ be a limited set. After that the set of all fact jobs (this is a part of $2^{\mathbb{N}}$) which please $S_t$ for $t \in F$ is a shut set $V_F$ of jobs pleasing the sentences in $F$. The junction of any kind of finitely most of the $V_F$ is nonempty, so by the limited junction building, the junction of every one of them is nonempty (given that the item room is portable), whence any kind of fact in this junction pleases all the declarations.

I do not recognize just how this operates in predicate logic.

0
2019-05-08 02:14:44
Source

The Compactness Theorem amounts the compactness of the Stone space of the Lindenbaum–Tarski algebra of the first-order language L . (This is additionally the room of 0-types over the vacant concept. )

A factor in the Stone room S L is a full concept T in the language L . That is, T is a set of sentences of L which is shut under sensible reduction and also has specifically among σ or ¬ σ for every single sentence σ of the language. The geography on the set of kinds has for basis the open collections U (σ ) = T : σ ∈ T for every single sentence σ of L. Note that these are all clopen collections given that U (¬ σ ) is corresponding to U (σ ).

To see just how the Compactness Theorem indicates the compactness of S L , intend the standard open collections U i ), i ∈ I, create a cover of S L . This suggests that every full concept T has at the very least among the sentences σ i . I assert that this cover has a limited subcover. Otherwise, after that the set ¬ σ i : i ∈ I is finitely regular. By the Compactness Theorem, the set regular and also therefore (by Zorn's Lemma ) is had in a maximally regular set T . This concept T is a factor of the Stone room which is not had in any kind of U i ), which negates our theory that the U i ), i ∈ I, create a cover of the room.

To see just how the compactness of S L indicates the Compactness Theorem, intend that σ i : i ∈ I is an irregular set of sentences in L . After that U (¬ σ i ), i ∈ I, creates a cover of S L . This cover has a limited subcover, which represents a limited irregular part of σ i : i ∈ I. Consequently, every irregular set has a limited irregular part, which is the contrapositive of the Compactness Theorem.

0
2019-05-08 00:05:03
Source

An adage which relates (and also occasionally real ) is "evidence are limited". In the majority of systems of logic present, the declaration and also an evidence of the declaration are limited strings of icons. One can consider them as "compactly" stood for. Just how wonderful then that particular systems will certainly constantly permit an evidence to be located if there is one. While this does not offer a limited link to geography, it recommends (and also you require to function this via by yourself to be encouraged ) that particular boundless problems (like a boundless evidence ) will certainly not take place. A comparable topological case is that, for portable collections, a boundless comprehensive chain of particular parts will certainly have nonempty junction, such a case conveniently attended be incorrect for some non-compact collections, such as the collection C_n = x >= n and also x is an actual number for n a non-negative integer.

0
2019-05-07 23:23:43
Source