Re: Is Validity Just a Hypothetical or Conditional Characteristic?



herbzet wrote:

Jan Burse wrote:

If you have a proof of the validity of
a sentence, you can look at the proof,
and will learn a lot of about the contribution
of the parts of the sentence to the validity
of the whole sentence.


If you have a valid sentence P -> Q then there is a
sentence P' = P of the form

P1 & P2 & P3 ... & Pn (0 < n)

and there is a sentence Q' = Q of the form

P1 & P2 & P3 ... & Pm (0 < m <= n).

That is, each conjunct of Q' is a conjunct of P'.

Here is a counter example to your above claim.
The following sentence is valid, but I don't
see how you would arrive at your decomposition:

p & ~p -> q

Can you give such a decomposition. Also the
decomposition mentioned by you, has nothing
to do with the method I suggested.

The method I suggested might include an axiom
schema A |- A. But in a proof, this axiom
schema might be applied multiple times, and
not only once.

If we have also weakening in our proof system,
we might see that A & B |- A v C is always
provable. But claiming that any proof of
P |- Q implies that P=A & B and Q=A v C would
be a false jump to conclusions.

Also craig's interpolation theorem says that
for P |- Q there is a formula D, such that
P |- D and D |- Q and D is formulated in the
common language of P and Q. But still this
does not imply some trivial form of D, in
my opinion.

Best Regards



.



Relevant Pages

  • Re: Is Validity Just a Hypothetical or Conditional Characteristic?
    ... each conjunct of Q' is a conjunct of P'. ... Can you give such a decomposition. ... schema A |- A. But in a proof, ...
    (sci.logic)
  • Re: Towards a definition of atomic
    ... given attribute within a given RDB schema. ... cardinality of D should be smaller than the cardinality of D' minus ... Database Systems, ACM, 1982, pp. 205-211. ... decomposition of domain types has been taken too far. ...
    (comp.databases.theory)
  • Re: Towards a definition of atomic
    ... given attribute within a given RDB schema. ... It depends a bit on what intuitive concept of equivalence you want to ... Database Systems, ACM, 1982, pp. 205-211. ... decomposition of domain types has been taken too far. ...
    (comp.databases.theory)
  • Towards a definition of atomic
    ... A decomposition of an attribute involves translation from an original ... DB schema to a new DB schema with alternative relations. ... is where those node identifiers in the first example come to play, ... it seems that the node identifiers aren't ...
    (comp.databases.theory)
  • Re: Is Validity Just a Hypothetical or Conditional Characteristic?
    ... Jan Burse wrote: ... each conjunct of Q' is a conjunct of P'. ... Oops, one decomposition would be: ... for any valid formula P -> Q it ...
    (sci.logic)