I have to argue that a given logical expression is satisfiable and not universally applicable. This is quite easy because all I have to do is find for which values is the expression true and false. However, I want to know how to write the solution formally. For example, let's say that we have the following expression:
$$\alpha_i := X \lor \lnot X$$
Due to the the laws of contradiction, we know that the expression is always true. But if I want to say that: "Let $X=T$ , $T$ is shorthand for TRUTH". How can I let $X$ take on the value of TRUTH?
This might be badly explained, but essentially I want to know how to formally write "let $X$ take on the value of TRUTH".
If you want to assume that the formula takes the value $True$ under some valuation, but may not be always true, write "Let $V(X) := True$", or "$[\![X]\!]_V := True$", where $V$ is the valuation function assigning truth values to formulas. (Depending on your textbook, it may call and symbolize that function differently, but it surely has been introduced somewhere.)
Then, after calculating the truth values of the compound formulas, you can say something like "With $V_1$ such that $V_1(X) = 1$, there exists a valuation under which the formula $X \land Y \to Z$ is true, so the formula is satisfiable, but under $V_2$ with $V_2(X) = \ldots$ the formula is false, so it is not universally valid".
If you want to say that $X$ is a formula which is tautological, i.e. logically equivalent to a statement of the form $A \lor \neg A$, then you can use the symbol $\top$ and write "Let $X := \top$". $\top$ is an atomic formula which always evaluates to $True$.