Skip to main content
SpringerLink
Log in

On Definability in Dependence Logic

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

An Erratum to this article was published on 14 July 2010

Abstract

We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  Google Scholar 

  • Enderton H.B. (1970) Finite partially-ordered quantifiers. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 16: 393–397

    Article  Google Scholar 

  • Hintikka J. (1996) The principles of mathematics revisited. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Hintikka, J., & Sandu G. (1989). Informational independence as a semantical phenomenon. In Logic, methodology and philosophy of science, VIII (Moscow, 1987) (Vol. 126 of Studies in Logic and Foundations of Mathematics, pp. 571–589) Amsterdam: North-Holland.

  • Hodges W. (1997) Compositional semantics for a language of imperfect information. Logic Journal of IGPL 5(4): 539–563 (electronic)

    Article  Google Scholar 

  • Hodges, W. (1997b). Some strange quantifiers. In Structures in logic and computer science (Vol. 1261 of Lecture Notes in Computer Science, pp. 51–65). Berlin: Springer.

  • Skolem, T. (1920). Logisch-kombinatorische Untersuchungen Über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen. Skrifter utgit av Videnskappsselskapet i Kristiania.

  • Skolem, T. (1970), In J. E. Fenstad (Ed.), Selected works in logic. Oslo: Universitetsforlaget.

  • Väänänen, J. (2007). Dependence logic (Vol. 70 of London Mathematical Society Student Texts). Cambridge: Cambridge University Press.

  • Walkoe W.J. Jr. (1970) Finite partially-ordered quantification. Journal of Symbolic Logic 35: 535–555

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Helsinki, P.O. Box 68, 00014, University of Helsinki, Finland

    Juha Kontinen

  2. ILLC, University of Amsterdam, Amsterdam, The Netherlands

    Jouko Väänänen

  3. Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland

    Jouko Väänänen

Authors
  1. Juha Kontinen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jouko Väänänen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juha Kontinen.

Additional information

An erratum to this article can be found online at http://dx.doi.org/10.1007/s10849-010-9125-6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kontinen, J., Väänänen, J. On Definability in Dependence Logic. J of Log Lang and Inf 18, 317–332 (2009). https://doi.org/10.1007/s10849-009-9082-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-009-9082-0

Keywords

Search

Navigation