Skip to main content
SpringerLink
Log in

Parity of Imperfection or Fixing Independence

  • Conference paper
Computer Science Logic (CSL 2003)

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

Included in the following conference series:

Abstract

We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bradfield, J.C.: Fixpoints in arithmetic, transition systems and trees. Theoretical Informatics and Applications 33, 341–356 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bradfield, J.C.: Independence: logics and concurrency. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 247–261. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Bradfield, J.C., Fröschle, S.B.: Independence-friendly modal logic and true concurrency. Nordic J. Computing 9, 102–117 (2002)

    MATH  Google Scholar 

  4. Cameron, P., Hodges, W.: Some combinatorics of imperfect information. J. Symbolic Logic 66, 673–684 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cenzer, D.: Monotone inductive definitions over the continuum. J. Symbolic Logic 41(1), 188–198 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gottlob, G.: Relativized logspace and generalized quantifiers over finite ordered structures. J. Symbolic Logic 62(2), 545–574 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hintikka, J., Sandu, G.: A revolution in logic? Nordic J. Philos. Logic 1(2), 169–183 (1996)

    MATH  MathSciNet  Google Scholar 

  8. Hodges, W.: Compositional semantics for a language of imperfect information, Int. J. IGPL 5(4), 539–563

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science, School of Informatics, King’s Bldgs, University of Edinburgh, Edinburgh, EH9 3JZ, UK

    Julian C. Bradfield

Authors
  1. Julian C. Bradfield
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Discrete Mathematics and Geometry, Technical University Vienna, Wiedner Hauptstrasse 8-10, A-1040, Wien, Austria

    Matthias Baaz

  2. Members of EACSL Jury for the Ackermann Award,  

    Johann A. Makowsky

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bradfield, J.C. (2003). Parity of Imperfection or Fixing Independence. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45220-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40801-7

  • Online ISBN: 978-3-540-45220-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation