Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

LPAR

2007

Springer

2007

Springer

Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly ordered sets of models of the underlying logic. This interpretation induces an entailment relation between sequence formulas which strongly depends on which orderings one wishes to consider. Some important classes are: all linear orderings, all dense linear orderings and all (or some speciﬁc) wellorderings. For all these classes one can ask for a sound and complete proof system for the entailment relation, as well as for its decidability. For the class of dense linear orderings and all linear orderings we give sound and complete proof systems which also yield decidability (assuming that the underlying logic is sound, complete and decidable). The entailment relation can be expressed in the ﬁrst-order theory of the ordering. Consequently, if the latter theory is decidable, then so is the corresponding entail...

Related Content

Added |
08 Jun 2010 |

Updated |
08 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
LPAR |

Authors |
Marc Bezem, Tore Langholm, Michal Walicki |

Comments (0)