SBVR — True/False meaning of logical formulations must be specified

Doc: dtc/06-03-02
Date: March 2006
Version: Interim Convenience Document
Chapter: 9.1.1
Pages:
Nature: Editorial
Severity: minor

Description:

In 9.1.1, 'logical formulation' is defined as:
"semantic formulation that is an abstract interpretation of a well-formed logical formula"

One may ask why it isn't just the expression as a wff. A Note to the effect that this is some kind of computational "abstract syntax" for a wff would help in putting this clause in perspective.

A 'closed logical formulation' has the property:
The meaning formulated by each closed logical formulation is a proposition.

It should be Noted that every kind of logical formulation can be closed by binding all of its free variables to constants. Consequently, it is important that every kind of 'logical formulation' specifies, for the case, in which it is closed, the circumstances under which the corresponding proposition is 'satisfied' or 'true', and those under which it is 'false'.

9.1.1.2 atomic formulation does not specify this.
9.1.1.3 instantiation formulation does not specify this.
9.1.1.4 modal formulation is a convenience concept, only its subtypes have meaning, and they do not specify it.
9.1.1.6 logical operation is a convenience concept, only its subtypes have meaning, and they do not specify it.
9.1.1.7 quantification is a convenience concept, only its subtypes have meaning, and they do not specify it.
9.1.1.8 objectification does not specify this.
9.1.1.9 projective formulation is a convenience concept, only its subtypes have meaning
aggregation formulation does specify this, but in a Note.
noun concept formulation does specify this, but in a Note.
fact type formulation does specify this, but in a Note.
proposition nominalization does specify this, but in a Note.
question nominalization does specify this, but in a Note.
answer nominalization does specify this, but in a Note.

Recommendation:

Add a Note to the glossary entry for 'closed logical formulation' that every kind of logical formulation can be closed by binding all of its free variables to constants, and thus formulates a proposition that is either true or false.

For each kind of logical formulation, specify the true/false/satisfaction behavior of the closed form in the normative/definitive text, e.g., the Definition, and not in a Note.

see above