Skip to main content

Iterate logic

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2183))

Abstract

We introduce a new logic for finite first-order structures with a linear odering. We study its expressive power. In particular we show that it is strictly stronger than first-order logic on finite structures. We close with a list of open problems.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ACM, editor. Conference on Object-Oriented Programming, Systems, Languages, and Applications,OOPSLA’ 99, volume 34 (10) of ACM SIGPLAN notices. ACM, ACM Press, 1999.

    Google Scholar 

  2. R. France. A problem-oriented analysis of basic uml static modeling concepts. In ACM[1].

    Google Scholar 

  3. M. Gogolla and M. Richters. On constraints and queries in UML. In Schader and Korthaus[15], pages 109-121.

    Google Scholar 

  4. A. Hamie. A formal semantics for checking and analysing UML models. In L. Andrade, A. Moreira, A. Deshpande, and S. Kent, editors, Proceedings of the OOPSLA’98 Workshop on Formalizing UML. Why? How?, 1998.

    Google Scholar 

  5. A. Hamie, J. Howse, and S. Kent. Navigation expressions in object-oriented modelling. In FASE’98.

    Google Scholar 

  6. A. Hamie, J. Howse, and S. Kent. Interpreting the object constraint language. In Proceedings of Asia Pacific Conference in Software Engineering. IEEE Press, July 1998.

    Google Scholar 

  7. N. Immerman. Languages that capture complexity classes. SIAM J. of Computing, 16(4):760–778, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  8. S.-K. Kim and D. Carrington. Formalizing the UML class diagram using Object-Z. volume 1723 of LNCS, pages 83–98. Springer, 1999.

    Google Scholar 

  9. P. Krishnan. Consistency Checks for UML. In Proceedings of the Asia Pacific Software Engineering Conference (APSEC 2000), pages 162–169, December 2000.

    Google Scholar 

  10. L. Mandel and M. V. Cengarle. On the expressive power of OCL. In FM’99-Formal Methods. World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 1999. Proceedings, Volume I, volume 1708 of LNCS, pages 854–874. Springer, 1999.

    Chapter  Google Scholar 

  11. OMG. Object constraint language specification, version 1.3. chapter 7 in [12]. OMG Document, March 2000.

    Google Scholar 

  12. OMG. OMG unified modeling language spezification, version 1.3. OMG Document, March 2000.

    Google Scholar 

  13. J.-E. Pin. Logic on words. Bulletin of the EATCS, 54:145–165, 1994.

    MATH  Google Scholar 

  14. M. Richters and M. Gogolla. On formalizing the UML object constraint language OCL. In T. W. Ling, S. Ram, and M. L. Lee, editors, Proc. 17th Int. Conf. Conceptual Modeling (ER’98), pages 449–464. Springer, Berlin, LNCS 1507, 1998.

    Google Scholar 

  15. M. Schader and A. Korthaus, editors. The Unified Modeling Language: technical aspects and applications. Physica-Verlag, 1998.

    Google Scholar 

  16. H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Progress in Theoretical Computer Science. Birkhäuser, 1994.

    Google Scholar 

  17. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Vol. B: Formal Models and Semantics, pages 135–192. Elsevier, Amsterdam, 1990.

    Google Scholar 

  18. J. Warmer and A. Kleppe. The Object Constraint Language: Precise Modelling with UML. Object Technology Series. Addison-Wesley, Reading/MA, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmitt, P.H. (2001). Iterate logic. In: Kahle, R., Schroeder-Heister, P., Stärk, R. (eds) Proof Theory in Computer Science. PTCS 2001. Lecture Notes in Computer Science, vol 2183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45504-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45504-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42752-0

  • Online ISBN: 978-3-540-45504-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics