Proving Infinitary Formulas

@article{Harrison2016ProvingIF,
  title={Proving Infinitary Formulas},
  author={Amelia Harrison and Vladimir Lifschitz and Julian Michael},
  journal={TPLP},
  year={2016},
  volume={16},
  pages={787-799}
}
The infinitary propositional logic of here-and-there is important for the theory of answer set programming in view of its relation to strongly equivalent transformations of logic programs. We know a formal system axiomatizing this logic exists, but a proof in that system may include infinitely many formulas. In this note we describe a relationship between the validity of infinitary formulas in the logic of here-and-there and the provability of formulas in some finite deductive systems. This… CONTINUE READING
Tweets
This paper has been referenced on Twitter 2 times. VIEW TWEETS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…