• Pfhorrest
    4.6k
    Following up on my previous discussions about a sole sufficient modal function and the meaning of the existential quantifier, I propose a sole sufficient quantification function:
    for()
    

    The for() function that takes three arguments, the first being a set of values that some variable can take to satisfy some formula, the second being that variable, and the third being that formula. (This would then be read as "for [these values of] [this variable], [this statement involving that variable] (is true)").

    This replicates some of functionality of another function frequently used together with the traditional quantification operators, ∈, which properly indicates that whatever is on the left of it is a member of the set on the right of it, but together with the existential operators is often used to write things like
    ∀x∈S...
    
    meaning "for every x in set S...", meaning that only the members of S satisfy the formula to follow. Expressions like the usual
    ∃x∈S...
    
    (meaning "for some x in set S...") can also be formed, with this function, by using the equivalent of an "or" function on the set in the first argument of for(), to yield an expression meaning "some of this set".

    And once again, like with the single operator I proposed for all modal logic earlier, if the first argument is the empty set, we are left with a special case of this function meaning "for no...", which we can then easily turn into "for some..." by negation, and then turn those two into "for all..." and "for not all..." by applying them to the negations of the formula in the third argument. E.g.

    negating "for no m, if m is a man then m is mortal",
    meaning "no men are mortal",
    gives us "for some m, if m is a man then m is mortal",
    meaning "some men are mortal";

    while "for no m is it not the case that if m is a man then m is mortal"
    means "for all m, if m is a man then m is mortal",
    or in other words "all men are mortal";

    and "for some m, it is not the case that if m is a man then m is mortal",
    in other words "some men are not mortal",
    of course means the same thing as "for not all m, if m is a man then m is mortal",
    or in other words, "not all men are mortal".
  • Banno
    23.4k
    I don't see that this is anything more than a restatement of ∀x ≡ ~∃~x. We only ever needed one quantifier. The other is just convenient.

    Same for modality.
  • Pfhorrest
    4.6k
    This is a generalization that can express a lot more than either ∀ or ∃. It can select an arbitrary quantity: you can punch in an exact number of things you want, not just "some". It just happens that if that number is zero, you've got the same as "not some" (i.e. none), which you can negate to get "some" (∃) and from there "all" (∀) and "not all".

    The sole sufficient operator for modality was really a lot more interesting (see the other thread). I admit that this topic is boring in comparison.
  • Philosophim
    2.2k
    This does seem mostly to be putting the symbols in a more modern day friendly form. However, the input of a specific number is logically unneeded. The point is handled by "at least one". If a specific number of things are important in your proof, then we should be using a different proof.
bold
italic
underline
strike
code
quote
ulist
image
url
mention
reveal
youtube
tweet
Add a Comment