Loading ...
Sorry, an error occurred while loading the content.

684Quantifying over functions in first-order logic

Expand Messages
  • cedricstjl
    Jun 8, 2006
    • 0 Attachment
      I have some difficulty seeing the difference in expressiveness between
      first-order logic and higher-order logics. Wikipedia (as well as AIMA,
      AFAICT) says that F-O logic cannot quantify over functions. But
      couldn't it be achieved equivalently by reifying functions and
      predicates? I.e.:

      x = fun(var)

      becomes

      x = call_function(fun, var)

      and then one can express reflexivity:

      for all fun, a, b: reflexive(fun) <=> call_function(fun, a, b) =
      call_function(fun, b, a)

      Cedric
    • Show all 9 messages in this topic