MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there an algebrization of second-order logic, analogous to Boolean algebras for propositional logic and cylindric and polyadic algebras for first-order logic?

share|cite|improve this question

Did programme of predicate calculus algebraization succeed? In his essay An autobiography of polyadic algebras Halmos outlined why he is not satisfied with his baby. I suggest that Cylindric algebras are not genuine algebras either; what other algebraic structures have operators parametrized by something (cylindrification)? The situation is strikingly different from either boolean or relation algebra, each having a set of intuitive binary, unary, [and 0-ary] operations.

I suggest that the culprit is positional perspective onto relation attributes. Positional perspective is ubiquitous in math (sequences, function arguments, etc), so is easy to see why it penetrated into the world of relations. Positional perspective makes perfect sense for binary relations, this is why nobody challenged its adequacy for n-ary ones. However, it is easy to see that attribute positions are not essential to the ability to match values of the two different attributes of two different relations. Named attribute perspective is widely used in database theory and practice, which implies yet another algebraization of predicate logic.

share|cite|improve this answer

Have you looked at the following paper:

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.