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

Call two axioms equivalent if they imply the same set of theorems. I am interested in decidability of so defined equivalence. In this generality the problem is obviously undecidable since it can be used to decide Entscheidungsproblem. So I am interested in cases where Entscheidungsproblem is decidable, particularly in case of monadic axioms (i.e. axioms containing only monadic functional and predicate symbols).

Any information about this would be appreciated.

Thank you for your time, Levon

share|cite|improve this question
Two sentences $\phi$ and $\psi$ imply the same sets of theorems if and only if $\phi\leftrightarrow\psi$ is a tautology. Thus when the Entscheidungsproblem is decidable for a Boolean-closed class (such as the monadic case you mention), this equivalence is also decidable. – Emil Jeřábek Mar 18 '11 at 15:19
Thank you for the answer. Initially I was concerned with the decidability of whether two axioms imply the same theorems of a specific form. Then I came to the above question and its triviality slipped my attention. Sorry for a stupid question. – Levon Mar 18 '11 at 17:08
up vote 1 down vote accepted

The comment showed that decidability of axiom equivalence is implied by decidability of pure logic. (I.e. to decide if $\Theta$ and $\Theta'$ are equivalent, it is equivalent to decide if $\vdash \Theta \leftrightarrow \Theta'$. Conversely, if one can decide axiom equivalence, then one can decide pure logic. Namely, $\vdash \Theta$ iff the axiom $\Theta$ is equivalent to $\top$.

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.