Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

A long-standing question to which I never found a concise answer is:

Is there something like an unambiguous deep structure of a formula of propositional logic, opposed to its comparingly arbitrary surface structure?

Here, I consider propositional logic with the connectives $\neg,\vee,\wedge,\rightarrow$.

At the surface level it is clear what a negation or a disjunction is: a negation is of the form $\neg (\phi)$, a disjunction is of the form $(\phi)\vee(\varphi)$, and so on.

But there are equivalent formulas that are not of the same type (the "deep structure" being a tree of types):

  • $\neg(\neg p) \equiv p $

  • $(p \wedge q )\vee(p \wedge \neg q) \equiv p$

  • $p \rightarrow q \equiv \neg p \vee q$

So you cannot define "is a formula of type X" bluntly by "has an equivalent formula of the form Y".

Is there eventually a simple rule to single out a distinguished representative among all equivalent formulas that represents the type of a formula $\phi$? Might this rule be as simple as "the formula with minimal numbers of variables, connectives and occurrences thereof"?

Or can there be several formulas with the same minimal numbers, but of different type?

share|improve this question
    
Do you know : Aarne Ranta, Type-theoretical grammar (1995) ?; but I'm not sure it can help you ... –  Mauro ALLEGRANZA Feb 24 at 14:16
add comment

5 Answers

Game semantics might be something like what you're looking for. If you have a formula and take all valid game traces for it, and then remove plays that correspond only to the visible connectives of the formula, keeping those that correspond to the atoms, then conceivably the set of partial traces you get could be considered to encode some kind of "deep structure" of the formula.

Ideas like these have been used to reason about "observational equivalence" of formulas, which sound like it's at least related to what you're talking about.

share|improve this answer
add comment

There are certainly normal forms of propositional formulae, e.g. CNF, but I don't think that any particular normal form can claim to be the "unique underlying deep structure of the formulae to which it is equivalent." After all, how simple a formula appears depends sensitively on what we plan to do with it.

share|improve this answer
    
I would like to be able to define the notion of a "simple" graph property (given as a closed formula in the language of graphs). This would be a formula that genuinely is not of the form $\neg\phi$ or $\phi \vee \psi$ and so on. Example: $(\forall x,y)\ R(x,y)$ (= the graph is complete). –  Hans Stricker Feb 24 at 13:43
    
@HansStricker, you may be interested in prenex normal form. –  user18921 Feb 24 at 13:44
    
Thanks, but PNF doesn't deal with the matrix. (see math.stackexchange.com/questions/18743/…) –  Hans Stricker Feb 24 at 13:50
add comment

You seem to be talking about a way to choose a particular surface structure to be the canonical representation of the formula.

But... Is it really necessary that the deep structure "look and feel" like a surface structure? If not, every formula in (classical) propositional logic can be reduced to an unambiguous deep structure in the form of a truth table.

p  ¬(¬p)
-  -----
F  F
T  T

p  q  (p∧q)∨(p∧¬q)
-  -  ------------
F  F  F
F  T  F
T  F  T
T  T  T

p  q  p⊃q  ¬p∨q
-  -  ---  -----
F  F  T    T
F  T  T    T
T  F  F    F
T  T  T    T

You can simplify the notation further if you like. For $n$ variables, construct an array of $n^2$ bits or a string of $n$ characters from the set $\{ ``F",`` T" \} -$ e.g., $(\lnot p \vee q)$ could be written as either 1 1 0 1 or 'TTFT'.

Of course, the meaning depends on the order of the rows and columns in the table, so to make it unambiguous, we need a convention: the columns for the input variables should be in alphabetical order from left to right, and the rows arranged so they count in binary from $0$ to $n^2-1$.

For example, in the notation of the J programming language, 2b00 2b01 2b10 2b11 is the base 2 notation for 0 1 2 3, and if you substitute F for 0 and T for 1, you can see that's how I've arranged the values of $p$ and $q$ in the tables above.

share|improve this answer
    
Your objection is legitimate: even in linguistics the deep structure of a sentence doesn't have the same "look and feel" as its surface structure. (And there is no reason, why it should.) On the other hand, truth tables are not quite what I am looking for. It will take me some time to explain why. (They are somehow "too far away" from the surface structure.) –  Hans Stricker Feb 24 at 15:08
1  
Related to one suggestion here: Wittgenstein, Tractatus 4.442, already suggests '(TFTT)(p,q)' as a way of perspicuously representing the truth-function $\neg p \lor q$. –  Peter Smith Feb 24 at 15:30
    
It's not only about perspicuousness (= unambiguousness), but also about conspicuousness (= salience). –  Hans Stricker Feb 24 at 19:40
add comment

"Is there eventually a simple rule to single out a distinguished representative among all equivalent formulas that represents the type of a formula ϕ? Might this rule be as simple as "the formula with minimal numbers of variables, connectives and occurrences thereof"? "

No. The law of commutation is a logical truth. That is, [(p→(q→r)→(q→(p→r)] is a tautology. The upshot here makes such a distinguished representative impossible to find in general, since along with modus ponens it ends up implying that (among endless possible examples) [p→(q→r)] is equivalent to [q→(p→r)]. But, both formulas have the same number of variables, connectives, and occurrences thereof. And 5 is the smallest possible number of symbols involved here (in Polish notation) for any formula which has three variables... that is you simply can't use fewer symbols than 5 to represent a formula equivalent to [p→(q→r)], but such a formula, in terms of what it represents semantically, is not unique. (and, of course, both formulas are of the implication type)

Also, even though both $\land$ and $\lor$ associate, they have fixed arity via the formation rules. Consequently, there is no such distinguished representative which is unique for cases which only involve only conjunctions or only disjunctions. So, even if you require that the first variable to always get labeled by the same symbol rendering the reasoning of the paragraph above irrelevant, you'll still have [p$\land$(q$\land$r)] as not qualifying as a unique, distinguished representative.

share|improve this answer
add comment

If you think to a "canonical representation of a formula", following @Doug Spoonwood refernce to polish notation and @Peter Smith reference to Wittgenstein, we can use the Sheffer stroke.

We have two possibilities :

(i) stay with the standard polish notation : $D\phi\psi$;

in this case, we have minimized the numebr of connectives, and we have a formula like : $DpDpDDqqDpp$.

(ii) Otherwise (see Wiki) :

since the only connective of this logic is $|$, the symbol $|$ could be discarded altogether, leaving only the parentheses to group the letters. A pair of parentheses must always enclose a pair of wffs. Examples of theorems in this simplified notation are $(p(p((qq)(pp))))$.

Are those representation unique ? I think so.

Are them "readable" ? I think not.

share|improve this answer
1  
I considered the Sheffer stroke, too, but deliberately didn't mention it in my question. In any case, it must be proved that a Sheffer stroke presentation with minimal numbers of variables, occurrences of variables, and parantheses is unique. (Or is this by any means obvious?) –  Hans Stricker Mar 2 at 16:21
1  
@HansStricker The Sheffer stroke "D" commutes. Thus, DpDpp and DDppp are logically equivalent having the same number of connectives, variables, and occurrences thereof. They're both tautologies. The formulas available in a Sheffer stroke calculus with just a single variable start Dpp, DDppp, DpDpp, (7 symbol formulas), (9 symbol formulas), and so on. Dpp is not a tautology. So, DDppp and DpDpp are the shortest tautologies in a Sheffer stroke calculus. Therefore, uniqueness fails. –  Doug Spoonwood Mar 6 at 4:19
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.