「‍」 Lingenic

Free Logic

(⤓.md ◇.md); γ ≜ [2026-07-17T120407.600, 2026-07-17T135416.643] ∧ |γ| = 3

Free Logic

Origin. Lambert introduced free logic (1960). Logic free of existential assumptions. Terms may denote nothing (non-denoting terms). Addresses: "The present king of France is bald." Empty domains allowed. Important for definite descriptions and fiction.

Models. Logic without existence assumptions. Classical: every term denotes, domain non-empty. Free logic: terms may fail to denote. "Pegasus flies" doesn't presuppose Pegasus exists. Inner/outer domain: existing vs possible objects. E! predicate: "exists."

Formalism.

Existence predicate: E!t — "t exists" (t denotes something in domain)

Positive free logic: Atomic formulas with non-denoting terms are false. P(t) → E!t (predicates imply existence)

Negative free logic: Atomic formulas with non-denoting terms are neither true nor false (or false). Partial interpretation function.

Neutral free logic: Non-denoting terms in atomics: truth value gap or third value.

Modified quantifier rules: ∀x.φ(x) → φ(t) only if E!t ∀x.φ(x) → (E!t → φ(t)) always valid

Universal instantiation: From ∀x.φ(x) and E!t, infer φ(t).

Definite descriptions: ιx.φ(x) — "the x such that φ" May fail to denote if no unique φ-satisfier. Russell: contextual definition. Free logic: allows non-denoting ι-terms.

Symbols.

SymbolUnicodeNameMeaning
E!ExistsExistence predicate
ιU+03B9IotaDefinite description
U+2200UniversalFor all existing
U+2203ExistentialThere exists
U+2193DefinedTerm denotes
U+2191UndefinedTerm fails to denote

Metatheory. Free logic is first-order. Completeness holds for various semantics. Decidability same as classical first-order (undecidable in general). Conservative extension: restricting to E!-true terms recovers classical logic. Multiple free logics: positive, negative, neutral. Identity: t = t may fail if t non-denoting.

Applies to. Philosophy (fictional entities, abstract objects). Definite descriptions (Russell, Strawson, Frege). Database theory (null values). Partial functions in CS. Modal logic (possibilia). Meinongian objects. Scientific theories with theoretical terms.

Limitations. Multiple incompatible versions. No consensus on "correct" free logic. Metatheory less developed than classical. Tool support limited. Interaction with other logics complex. Empty domain adds complications. Non-denoting detection not always decidable.

© 2026 Lingenic LLC