Why are conjunctions or disjunctions in propositional calculus not allowed on an infinite set of formulas? I'm reading a text book about propositional calculus and it says that $ \bigvee_{\phi_i \in \Phi}{\phi_i} $ and $ \bigwedge_{\phi_i \in \Phi}{\phi_i} $ are not allowed, if $ \Phi $ is not finite. It does not give an explanation. Could you please explain the reason behind this?
 A: Because "standard" logic syntax defines formulae as expression of finite lenght.
The "reason" is due to the fact that formal languages model (or mimick) natural language, where we are not accustomed to use "text" (spoken or writen) of infinite lenght.
But we have also Infinitary Logic.

In general, we can refer to Formal Languages:

In mathematics, computer science, and linguistics, a formal language is a set of strings of symbols together with a set of rules that are specific to it.
An alphabet, in the context of formal languages, can be any set, although it often makes sense to use an alphabet in the usual sense of the word. The elements of an alphabet are called its letters. 
Alphabets may be infinite; however, most definitions in formal language theory specify finite alphabets, and most results only apply to them.
A word over an alphabet can be any finite sequence (i.e., string) of letters. In some applications, especially in logic, the alphabet is also known as the vocabulary and words are known as formulas.


You can see, for a gentle introduction to mathematical logic:


*

*Richard Kaye, The Mathematics of Logic: A guide to completeness theorems and their applications, Cambridge UP (2007), page 24:



Formal systems are kinds of mathematical games with strings of symbols and
  precise rules. They mimic the idea of a ‘proof’. [...] The particular system that we shall look at here [...] is based on finite sequences, or strings, of $0$s and $1$s.

And page 64:

We are going to develop a formal system for proofs about boolean algebras [the propositional calculus].
Let $X$ be any set, which for this definition will be called a set
  of propositional letters. The set of boolean terms $\text {BT}(X)$ over $X$ is defined as a set of expressions, or strings [or finite sequences] of symbols, from a set of symbols including $(, ), \land, \lor, \top, \bot, ¬$ and all elements of $X$, as follows [...]
A formal proof or derivation from assumptions $Σ ⊆ \text{BT}(X)$ is a derivation of finite length where each statement in it is [...]

As you can see, the "finiteness" requirement is at the core of elementary logic.
