Nepedia
Back to Discover
Advanced Reader
🔢

Atomic formula

math Maturity 11-13 Next article →

In the study of mathematical logic, researchers look for the most basic building blocks of thought. These fundamental units are called atomic formulas. They are also known as atoms or prime formulas. An atomic formula is the simplest kind of well-formed formula in a logical system. It has no deeper propositional structure. This means it does not contain any logical connectives. It also means it has no strict subformulas inside it. You can think of atoms as the unbreakable pieces of a logical language.

To understand how logic grows, we must look at how atoms interact with other tools. Logical connectives are used to join simple ideas into larger ones. Common connectives include words like "and" or "or." There are also quantifiers, such as "for-all" or "there-exists." When you use these tools to join atoms, you create compound formulas. Compound formulas are much more complex than the atoms that form them. An atom remains simple because it lacks these internal connections. It exists as a single, solid unit of information.

The definition of an atom changes depending on the type of logic being used. In propositional logic, people often discuss propositional variables. A variable is a formal expression that denotes an atomic formula. However, the variable itself is not the atom. In predicate logic, atoms take a different shape. They consist of predicate symbols paired with their arguments. Each of these arguments is known as a term. In the field of model theory, atoms are viewed as strings of symbols. These strings follow a specific rule called a signature. These strings may or may not be satisfiable within a given model.

First-order logic provides a very specific way to construct these atoms. This system relies on well-formed terms and propositions. A term is defined recursively in three ways. First, a term can be a constant, which is a named object from a domain of discourse. Second, a term can be a variable, such as x, which ranges over objects in that domain. Third, a term can be an n-ary function. This type of function takes a tuple of objects and maps them to another object. These terms serve as the raw materials for building atoms.

Once you have terms, you can create a proposition. A proposition is defined as an n-ary predicate applied to a set of terms. An atomic formula is specifically a predicate applied to a tuple of terms. We write this mathematically as P(t1, ..., tn). Here, P represents the predicate and the tn terms are the arguments. All other well-formed formulas in this system are built by composing these atoms. You do this by using logical connectives and quantifiers. Because atoms do not contain quantifiers, all variable symbols within an atom are considered free.

We can see this process in action by examining a complex formula. Consider the expression: ∀x. P (x) ∧ ∃y. Q (y, f (x)) ∨ ∃z. R (z). This long string of symbols looks very complicated at first glance. However, it is actually built from several distinct atoms. In this specific example, the atoms are P(x), Q(y, f(x)), and R(z). The quantifiers and connectives like "and" and "or" simply tie these atoms together. By breaking the formula down, we find the simple atoms at its core.

Atomic formulas are essential to several different branches of mathematical study. In proof theory, the assignment of polarity to atomic formulas is a vital part of a process called focusing. In model theory, structures work by assigning a specific interpretation to these atomic formulas. This allows mathematicians to understand how simple symbols relate to larger mathematical universes. Whether looking at the syntax of a formula or its meaning in a model, the atom is the starting point. Everything in formal logic eventually traces back to these simple, indivisible pieces.

643 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

More to explore

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.