Atomic Sentence¶
A closed formula formed by an atomic base clause, not by a connective or quantifier, in a specified formal logic.
Core Idea¶
An atomic sentence is a closed expression that the formation rules of a specified formal logical language introduce as an atom, rather than construct by a connective or quantifier. The two tests matter independently: the expression must match an atomic formation clause, and it must have no free variables. In truth-functional logic (TFL), a sentence letter such as \(A\) passes both tests. In first-order logic (FOL), \(F(a)\) can pass both, while \(F(x)\) is an atomic formula but not a sentence if \(x\) is free.[1][2]
Atomhood is syntactic, not a verdict that an assertion is true, basic in nature, or indivisible in every possible language. Once a grammar has identified its sentences, a valuation or interpretation supplies their truth conditions. A change of interpretation can change whether \(F(a)\) is true without altering its status as an atomic sentence. The syntax also explains why \(\neg F(a)\) and \((F(a)\wedge G(b))\) are non-atomic even though they are closed sentences, and why \(\forall xF(x)\) can be closed while remaining non-atomic.[1][2]
The reusable domain-specific pattern is a formal base case constrained by closure. Those constraints survive changes of notation and application: a TFL letter can be an input to a truth table, and a ground FOL atom can be a member of a logic program's Herbrand base. The identity is narrower than a generic “simple claim” or the semantic proposition expressed by a sentence.[3]
Structural Signature¶
Sig role-phrases: declared formal language — atomic formation clause — no free variables — separate interpretation — compound construction boundary.
- Declared language: its symbols, arities and formation clauses establish which strings are well-formed and what counts as a base-case atom. Atomhood cannot be inferred from string length alone.[1][2]
- Atomic formation clause: in TFL, a sentence letter is basic; in the cited FOL grammar, a predicate of the right arity applied to terms, an equality of terms, or a permitted sentence letter is an atomic formula.[2]
- Sentential closure: a formula is a sentence only when it has no free variables. In a variable-free FOL atom the predicate arguments are ground terms; an occurrence such as \(F(x)\) fails this second test when \(x\) is free.[2]
- Interpretation: a valuation or model evaluates the identified sentence. Evaluation is downstream of the syntactic classification and does not turn a compound into an atom.[1][3]
- Compound boundary: a formation rule headed by negation, another connective, or a quantifier creates a different, non-atomic formula. A compound may still be a sentence if it is closed.[1][2]
Recognition therefore proceeds in order: name the formal grammar; parse the expression against its atomic base clauses; inspect free variables; only then ask about truth in an interpretation. If either of the middle two tests fails, the expression is not an atomic sentence under that grammar.
What It Is Not¶
- Not every atomic formula. \(F(x)\) is an atomic FOL formula, but an unbound \(x\) prevents it from being a sentence. This is the closest near-miss.[2]
- Not a literal in general. A positive atom is a literal under common usage, but a negative literal \(\neg F(a)\) is built by a connective and is not atomic under the cited formation rules. The live Literal entry thus has a different boundary.
- Not every closed formula. A conjunction or quantified formula may have no free variables while still being constructed from atomic material.[2]
- Not a short English sentence. “The dog ran” could be translated into a letter in one formalization or a structured predicate formula in another. English grammatical simplicity is not itself a formal atomic-formation rule.[1]
- Not the proposition expressed. The catalog's Proposition concerns abstract truth-evaluable content; an atomic sentence is a syntactic expression in a particular language. Different expressions may express related content without sharing syntactic atomhood.
Scope of Application¶
The class applies within explicitly specified formal languages, especially propositional and first-order systems and their logic-programming uses. In TFL, the smallest sentences are designated letters. In the cited FOL grammar, atomic formulas include predicate applications and equalities, but only closed instances are atomic sentences. Some other logics choose different primitive clauses, so the correct test follows their stated grammar rather than this entry's examples by analogy.[1][2]
The label is useful in parsing, model interpretation and construction of larger formulas. In logic programming, the Herbrand base is built from ground atoms of a signature; an interpretation selects a subset of that base. Those facts do not entail that every logical atom can be given an independent truth value under every semantics. Shared predicates, equality and program rules can impose constraints; syntactic atomhood must not be confused with semantic independence.[3]
The frozen candidate's gesture toward natural-language “hidden atomic sentences” is not admitted as a general property of natural language. Formalization may choose a granularity, but a precise atomic-sentence judgment requires the target formal language and translation convention.
Clarity¶
Two axes clarify borderline cases. Atomic versus compound asks which formation clause built the formula. Closed versus open asks whether any variable remains free. \(F(a)\) is atomic and closed; \(F(x)\) is atomic and open; \(\forall xF(x)\) is compound and closed. The words “atomic” and “sentence” therefore do separate work.[2]
No truth claim follows from this classification. A parser can recognize \(F(a)\) before an interpretation tells us what \(F\) and \(a\) denote. Conversely, an English utterance may have an obvious truth value in ordinary discourse but lack any formal-language atomhood until one states a regimenting grammar. The definition prevents a semantic judgment from being smuggled into a syntactic one.
Manages Complexity¶
Atomic sentences provide the base cases of an inductive syntax. Instead of listing every possible sentence, a formal definition admits basic atoms and gives recursive rules for negation and binary connectives; every compound can be parsed back to its atomic occurrences. This organizes infinitely many well-formed expressions with a finite set of formation clauses.[1]
The same separation makes model description tractable. A logic-programming Herbrand base enumerates the possible ground atom instances for a signature; an interpretation can then be represented by which members it includes. The base can be large or infinite when function symbols generate endlessly many terms, so atomhood is a classification aid, not a promise of a small finite universe.[3]
Abstract Reasoning¶
For a proposed example, first identify the language and the permitted term and predicate symbols. Check arity and the base-clause pattern: \(R(a,b)\) is an atom only if \(R\) is declared binary and \(a,b\) are terms of that language. Then inspect each variable occurrence. If one remains free, the expression is an atomic formula but not an atomic sentence. If a connective or quantifier is the constructor of the whole expression, the result is compound even if its constituents are atomic.[2]
Only after this syntactic sequence does interpretation enter. Under a chosen structure, a ground predicate application receives a truth value according to the denotations of its terms and predicate. The recognition procedure transfers from a classroom truth table to a Herbrand model, but the semantics of the two settings must not be flattened into one claim about freely assigning all atoms.[1][3]
Knowledge Transfer¶
The transfer from TFL to FOL is a transfer of roles, not identical alphabet. A TFL letter is introduced directly as a closed sentence. An FOL atom can carry predicate-and-term structure, so it must additionally clear a free-variable test to be a sentence. Both can serve as base cases for larger expressions, but FOL exposes object-level relations that a bare TFL letter leaves opaque.[1][2]
Logic programming inherits the FOL side: the Herbrand base consists of ground predicate instances, and an interpretation chooses which of those instances hold. This permits a model to discuss particular ground facts while programs use variable-bearing rules to describe patterns. A rule pattern and a ground atom are related but not the same syntactic object.[3]
Examples¶
Truth-functional language. In the TFL grammar of forall x: Calgary, \(A\) and \(B\) are sentence letters and atomic sentences. A valuation can make either true or false; the formation rules then determine the value of \((A\wedge\neg B)\). Neither \(\neg B\) nor the conjunction is an atomic sentence, because a connective constructs each.[1] Mapped back: declared formal language = TFL; atomic formation clause = sentence-letter base rule admitting \(A,B\); no free variables = TFL letters contain none; separate interpretation = the valuation; compound construction boundary = \(\neg\) and \(\wedge\) form non-atomic results.
Herbrand base in logic programming. Nilsson and Małuszyński use a signature with ground terms \(0,s(0),s(s(0)),\ldots\) and atoms such as \(\mathrm{odd}(0)\) and \(\mathrm{odd}(s(0))\). Those predicate applications belong to the Herbrand base because their terms are ground. \(\mathrm{odd}(x)\) is still an atomic formula, but with free \(x\) is not a sentence. A Herbrand interpretation selects which ground atoms hold; syntax alone does not decide that selection.[3][2] Mapped back: declared formal language = the signature with \(0,s,\mathrm{odd}/1\); atomic formation clause = predicate applied to a term; no free variables = ground terms in \(\mathrm{odd}(0)\); separate interpretation = selected subset of Herbrand base; compound construction boundary = program rules or logical operators relate atoms without becoming atoms themselves.
Boundary counterexample. \(\forall xF(x)\) has no free variables but its outer constructor is a quantifier, so it is a sentence but not an atomic one. Calling it “simple” in a natural-language gloss cannot override the formal parse.[2]
Structural Tensions¶
Propositional opacity versus first-order structure. A single TFL letter keeps truth-functional reasoning and valuation compact, but conceals the objects and predicates in the claim. A first-order atom exposes those argument positions and supports reasoning about them, at the cost of a richer signature and interpretation. Neither granularity is automatically best. Diagnostic: Does the question require only connective-level truth relationships, or must it distinguish which objects stand in which predicate positions?[1][2]
Ground evaluation versus variable-bearing generality. A ground atom is a closed sentence that an interpretation can evaluate directly; writing every individual ground instance may be unwieldy. An open atom such as \(F(x)\) is a compact pattern over possible instances, but it is not a sentence without binding or substitution. Diagnostic: Is the task assessing a particular ground claim, or expressing a general rule whose variable must be bound or instantiated?[2][3]
Structural–Framed Character¶
Vocabulary travel: “atom” and “base case” travel across syntax and computation, but “atomic sentence” requires formal-logical well-formedness and free-variable closure. Evaluative weight: neither praise nor norm is built into the definition; atomhood is a parse property. Institutional origin: formal logic supplies the formation-rule convention rather than a natural-language intuition. Human-practice bound: analysts choose the language and translation, but once fixed the test is formally repeatable. Import versus recognition: using an atomic-sentence analysis outside logic imports a grammar; one cannot simply recognize short phrases as atoms without that commitment. These five criteria place the identity on a formal-structural, domain-bounded side rather than treating it as a universal notion of elementary fact.[1][2]
Structural Core vs. Domain Accent¶
The portable skeleton is an inductive base case from which larger structures can be built. That skeleton alone is too broad for this entry; whether it belongs to a new or existing prime is a separate higher-order question. The domain accent here is decisive: a formula of a specified formal language must be generated by an atomic clause and be free of free variables. Remove the grammar, the atomic clause, or the closure check, and this specific identity disappears.[2]
The live Formal System is not a genus of individual sentences: it is a package of symbols, axioms and derivation rules. Syntax (logic) concerns a language's general formation rules, and Proposition concerns content. They are neighbors that help define the boundary, not evidence for a strict parent relation.
Instantiates / Related Primes¶
Atomic-sentence reasoning is related to the live prime Formal System because formation rules are part of formal systems, and to Symbolic Representation because formal tokens can represent assertions by convention. Neither is asserted as a strict parent: a formal system is an encompassing rule package rather than a type of sentence, and a sign–meaning relationship does not by itself supply this syntax-and-closure criterion.
The broader base-case idea and the narrower atomic-formula class may warrant future graph nodes. This entry should not be attached to them before their identities and edge types have been separately adjudicated.
Neighborhood in Abstraction Space¶
Atomic Sentence sits in a sparse region of the domain-specific corpus (71st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Logical Semantics & Many-Valued Systems (11 abstractions)
Nearest neighbors
- Well-Formed Formula — 0.87
- Propositional logic — 0.85
- Propositional formula — 0.84
- Literal (Mathematical Logic) — 0.84
- Tautology (Logic) — 0.83
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
Atomic formula is broader because it may contain free variables. Literal can be a negated atom, which is compound under the cited grammar. Proposition is usually content that can be expressed by different sentences, not the particular syntactic token. Simple sentence in English is a grammatical classification, not the formal base clause. Ground fact in a program may be asserted or derivable; an atomic sentence can be false or unasserted. These contrasts keep syntax, semantics and proof status distinct.[2][3]
References¶
[1] P. D. Magnus et al., forall x: Calgary, ch. 6, §§6.1–6.2, especially the TFL sentence-letter base clause and inductive compound clauses. https://forallx.openlogicproject.org/html/Ch6.html registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m
[2] P. D. Magnus et al., forall x: Calgary, ch. 27, §§27.2–27.3, atomic formula clauses, examples and free-variable sentence criterion. https://forallx.openlogicproject.org/html/Ch27.html registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s
[3] Ulf Nilsson and Jan Małuszyński, Logic, Programming and Prolog, 2nd ed., ch. 2, Definitions 2.4 and 2.7 and Example 2.5, printed pp. 35–37, author-hosted edition. https://www.ida.liu.se/~ulfni53/lpp/ registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i