 FSC draws inspiration from modern logic, which emphasizes the formalization of deductive reasoning. To formalize, we specify a formal language whose component linguistic expressions are individuated non-semantically (e.g., by their geometric shapes). We describe the expressions as pieces of formal syntax, without considering what if anything the expressions mean. We then specify inference rules in syntactic, non-semantic terms. Well-chosen inference rules will carry true premises to true conclusions. By combining formalization with Turing-style computation, we can build a physical machine that manipulates symbols based solely on the formal syntax of the symbols. If we program the machine to implement appropriate inference rules, then its syntactic manipulations will transform true premises into true conclusions.