Re: Comparing times in FOPC

Gary Leighton wrote:

>
> The reason why I think it is invalid is because predicates in FOPC
> cannot perform comparisons like A > B.

One has a domain Q of quantification. A (binary) predicate can be
interpreted as a subset of Q x Q. So if it makes sense to compare the
things in the domain with "greater", then it's ok.
.

Relevant Pages

  • Re: Comparing times in FOPC
    ... > Gary Leighton wrote: ... >> The reason why I think it is invalid is because predicates in FOPC ...
    (sci.logic)
  • Inheritance vs Alternative Pruning and Imputed Defaults
    ... Almost all the Object Oriented stuff people layer on predicates are, ... Another, related, problem is that inheritance provides defaults ... maximization or multi-relational data mining via inductive logic ... the other reason you want all this OO stuff is so you can avoid ...
    (comp.lang.prolog)
  • Re: Questioning the defintions of set and element.
    ... of omega), but only countably many properties P. ... quantify over predicates? ... his or her mind -- that there's a predicate for every set. ... you and I both know that this is flawed, for the reason that you ...
    (sci.math)
  • <ping> Jim Burns: intensional predicates
    ... >> extensionality in some domains. ... > different predicates. ... I agree that what I wrote above is invalid. ... explaining or even describing intensional predicates. ...
    (sci.logic)
  • <ping> Jim Burns: intensional predicates
    ... >> extensionality in some domains. ... > different predicates. ... I agree that what I wrote above is invalid. ... explaining or even describing intensional predicates. ...
    (sci.math)