Event Detail

A logical formula F(X,P) can be treated as an equation to be satisfied by the solutions X(P). John McCarthy considers the parameterization of the models of formulas, gives the general solution in the case of propositional logic, and states the problem for other logics. We find the general solution for the formulas in the first-order language with monadic predicates and equality. The solutions are obtained via quantifier elimination and parametrized by epsilon terms. This talk is based on joint work of the speaker and T. Hoshi.

Reference: John McCarthy, “Parameterizing the set of models of a propositional theory”. Available at http://www-formal.stanford.edu/jmc/parameterize.html.