"

Variables and atomic formulas

Letโ€™s start with the variables. Variables in โ„’1\mathcal{L}_1 function similar to constants. In particular, just as there is a set of constants ๐” n\mathfrak{c}_n for each natural number nn, in โ„’1\mathcal{L}_1, there is also a set of variables ๐ฑn\mathbf{x}_n, for each natural number nn. In list format, we have:

๐ฑ1,๐ฑ2,๐ฑ3,๐ฑ5,๐ฑ6,....\mathbf{x}_{1}, \mathbf{x}_{2}, \mathbf{x}_{3}, \mathbf{x}_{5}, \mathbf{x}_{6}, ….

Moreover, these variables can take exactly the same places as the constants. For example, if you have a predicate ๐”“22\mathfrak{P}^{2}_{2}, then both ๐”“22(๐” 4,๐” 2)\mathfrak{P}^{2}_{2}(\mathfrak{c}_{4}, \mathfrak{c}_{2}) and ๐”“22(๐ฑ4,๐ฑ9)\mathfrak{P}^{2}_{2}(\mathbf{x}_{4}, \mathbf{x}_{9}) are atomic formulas. Because of this, constants and variables together are usually called terms, to simplify the definition of what it means for something to be an atomic formula. Thus first, we have:

Definition 6.1 (Constants, variables, terms). The set ๐–ข๐–ฎ๐–ญ๐–ฒโ„’1={๐” nโˆฃnโˆˆโ„•}\mathsf{CONS}_{\mathcal{L}_1}=\{\mathfrak{c}_{n} \mid n \in \mathbb{N}\}, and we call it the constants of โ„’1\mathcal{L}_1. The set ๐–ต๐– ๐–ฑโ„’1={๐ฑnโˆฃnโˆˆโ„•}\mathsf{VAR}_{\mathcal{L}_1}=\{\mathbf{x}_{n} \mid n \in \mathbb{N}\} and we call it the variables of โ„’1\mathcal{L}_1. The set ๐–ณ๐–ค๐–ฑ๐–ฌโ„’1={tโˆฃtโˆˆ๐–ต๐– ๐–ฑโ„’1 or tโˆˆ๐–ข๐–ฎ๐–ญ๐–ฒโ„’1}\mathsf{TERM}_{\mathcal{L}_1}=\{t \mid t \in \textsf{VAR}_{\mathcal{L}_1} \text{ or } t \in \textsf{CONS}_{\mathcal{L}_1}\}, and we call it the terms of โ„’1\mathcal{L}_1.

Remark 6.1. Notice that we do not use our special font for denoting terms, because technically, every term tt stands for either a variable or a constant of โ„’1\mathcal{L}_1

Once we have the notion of a term, which is, again, either a variable or a constant of the language โ„’1\mathcal{L}_1, we can easily define again what it means for something to be an atomic formula โ€“ this time for โ„’1\mathcal{L}_1.

As just mentioned, there is nothing more to this than specifying that if you have an nn-place predicate ๐”“kn\mathfrak{P}^{n}_{k}, and it is followed by nn terms (constants or variables) of โ„’1\mathcal{L}_1 in parentheses, separated by commas, then the resulting expression ๐”“kn(t1,...,tn)\mathfrak{P}^{n}_{k}(t_1, …, t_n) is an atomic formula of โ„’1\mathcal{L}_1.

Here are a few examples of atomic formulas of โ„’1\mathcal{L}_1 ๐”“33(๐” 3,๐ฑ5,๐ฑ9)๐”“33(๐ฑ2,๐” 6,๐” 7)๐”“42(๐” 3,๐” 5)๐”“42(๐ฑ7,๐ฑ8)\begin{gathered} \mathfrak{P}^{3}_{3}(\mathfrak{c}_{3}, \mathbf{x}_{5}, \mathbf{x}_{9})\\ \mathfrak{P}^{3}_{3}(\mathbf{x}_{2}, \mathfrak{c}_{6}, \mathfrak{c}_{7})\\ \mathfrak{P}^{2}_{4}(\mathfrak{c}_{3}, \mathfrak{c}_{5})\\ \mathfrak{P}^{2}_{4}(\mathbf{x}_{7}, \mathbf{x}_{8}) \end{gathered} There are a few things you should notice here. First, there are atomic formulas in which both variables and constants occur. Moreover, there are other atomic formulas which are just like the ones before, but in place of variables, there are now constants, and in place of constants, there are now variables. So in general, constants and variables can always take each othersโ€™ places. Second, there are atomic formulas that only have constants, and atomic formulas that only have variables, and in each of these cases, for any predicate ๐”“\mathfrak{P}^{}_{}, the situation could have been the converse.

So again, we have:

Definition 6.2 (Atomic formula). If PnP^n is an nn-place predicate of โ„’1\mathcal{L}_1 (i.e., Pnโˆˆ๐–ฏ๐–ฑ๐–ค๐–ฃโ„’1P^n \in \textsf{PRED}_{\mathcal{L}_1}), and t1,...,tnt_1, …, t_n are terms of โ„’1\mathcal{L}_1 (i.e., t1,...,tnโˆˆ๐–ณ๐–ค๐–ฑ๐–ฌโ„’1t_1, …, t_n \in \mathsf{TERM}_{\mathcal{L}_1}), then: Pn(t1,...,tn)P^n(t_1, …, t_n) is an atomic formula of โ„’1\mathcal{L}_1. The set of atomic formulas of โ„’1\mathcal{L}_1 is denoted ๐– ๐–ณ๐–ฎ๐–ฌโ„’1\textsf{ATOM}_{\mathcal{L}_1}.

License

Icon for the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Learning Logic Backwards Copyright © by Peter Susanszky is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License, except where otherwise noted.