Atomic Sentence¶

A closed formula formed by an atomic base clause, not by a connective or quantifier, in a specified formal logic.

Version: v1 · 2026-10-03 · History
Domain-specific #: 12995
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Formal Logic → Mathematics
Aliases: Atomic Sentences

Core Idea¶

An atomic sentence is a formula that both matches an atomic base clause of a specified formal logic and has no free variables. In truth-functional logic a sentence letter such as \(A\) meets both conditions. In first-order logic \(F(a)\) can also do so, while \(F(x)\) is an atomic formula but not a sentence if \(x\) is free. Negation, conjunction and quantification build non-atomic formulas, even when the result is a closed sentence. Atomhood is syntactic; an interpretation, not the parse, determines truth.[^{ref-f50607f7d754][}ref-f50607f7d754-2]

Scope of Application¶

The identity applies only after a formal language's formation rules and variable-binding conventions are declared. It supports truth-functional evaluation, first-order model interpretation and Herbrand-base construction in logic programming. Nilsson and Małuszyński's Herbrand base contains ground atoms such as \(\mathrm{odd}(0)\) and \(\mathrm{odd}(s(0))\); a Herbrand interpretation selects which such atoms hold.[^ref-642ddd7c4e33]

A short English sentence is not automatically atomic. Nor is a negative literal, an open atomic formula, or a proposition understood as abstract content. Those are different classifications. No strict DAG parent is asserted here: the live Formal System is an encompassing rule package, not a genus of single sentences.

Clarity¶

Check atomic versus compound and closed versus open separately. \(F(a)\) is atomic and closed; \(F(x)\) is atomic and open; \(\forall xF(x)\) is compound and closed. The closest near-miss is \(F(x)\): it passes the atomic-formation test but fails sentential closure. The same string may keep its syntactic class even if its truth varies between interpretations.[^ref-f50607f7d754-2]

Manages Complexity¶

Atomic sentences are the base cases from which an inductive grammar generates indefinitely many compound sentences. A small set of formation clauses replaces an impossible enumeration and makes it possible to parse a compound back to its atomic occurrences. In logic programming, the ground-atom Herbrand base similarly gives a defined universe of possible atomic instances, though it need not be small or finite.[^{ref-f50607f7d754][}ref-642ddd7c4e33]

Abstract Reasoning¶

To classify a candidate, identify the language, verify that its predicate arities and terms match an atomic clause, and inspect all variables for freedom. A top-level connective or quantifier rules out atomhood; a free variable rules out sentencehood. Only after both syntactic checks should a valuation or model be used to ask whether the sentence is true. This blocks the mistaken move from a simple-looking natural-language claim to an unspecified formal atom.[^ref-f50607f7d754-2]

Knowledge Transfer¶

The role mapping changes across settings. In TFL, \(A\) and \(B\) are primitive, closed sentence letters; a valuation supplies truth values and \((A\wedge\neg B)\) is compound. In first-order logic programming, \(\mathrm{odd}(0)\) is a predicate on a ground term and can enter a Herbrand base; \(\mathrm{odd}(x)\) remains an open atom. The shared base-case-and-closure test transfers, but TFL opacity, FOL argument structure and their interpretations must not be collapsed into one semantics.[^{ref-f50607f7d754][}ref-f50607f7d754-2][^ref-642ddd7c4e33]

[^ref-f50607f7d754]: P. D. Magnus et al., forall x: Calgary, ch. 6, §§6.1–6.2. https://forallx.openlogicproject.org/html/Ch6.html [^ref-f50607f7d754-2]: P. D. Magnus et al., forall x: Calgary, ch. 27, §§27.2–27.3. https://forallx.openlogicproject.org/html/Ch27.html [^ref-642ddd7c4e33]: Ulf Nilsson and Jan Małuszyński, Logic, Programming and Prolog, 2^nd ed., ch. 2, Definitions 2.4 and 2.7 and Example 2.5. https://www.ida.liu.se/~ulfni53/lpp/

Neighborhood in Abstraction Space¶

Atomic Sentence sits in a sparse region of the domain-specific corpus (71^st 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

Computed from structural-signature embeddings · 2026-10-08