Studia Logica

, Volume 66, Issue 2, pp 273–283 | Cite as

Functional Dependencies between Variables

  • Natasha Alechina


We consider a predicate logic Lfd where not all assignments of values to individual variables are possible. Some variables are functionally dependent on other variables. This makes sense if the models of logic are assumed to correspond to databases or states. We show that Lfd is undecidable but has a complete and sound sequent calculus formalisation.

quantifiers assignments functional dependencies 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Abiteboul, S., R. Hull, and V. Vianu, Foundations of Databases, Addison-Wesley Publishing Company, 1995.Google Scholar
  2. [2]
    Alechina, N., Modal Quantifiers, PhD thesis, ILLC, University of Amsterdam, 1995.Google Scholar
  3. [3]
    AndrÉka, H., J. van Benthem, and I. NÉmeti, ‘Back and forth between modal logic and classical logic’, Bulletin of the Interest Group in Pure and Applied Logic 3 (1995); 685-720.Google Scholar
  4. [4]
    Scott, D., ‘Identity and existence in intuitionistic logic’, in M.P. Fourman, C.J. Mulvey, and D.S. Scott (eds.), Applications of Sheaves, Springer Lecture Notes in Mathematics 753, 660-696, 1979.Google Scholar
  5. [5]
    NÉmeti, I., ‘Decidability of weakened versions of first order logic and cylindric relativized set algebras’, in L. Csirmaz, D.M. Gabbay, and M. de Rijke (eds.), Logic Colloquium '92, CSLI, Stanford, 1992.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Natasha Alechina
    • 1
  1. 1.School of Computer Science and Information TechnologyUniversity of NottinghamNottinghamEngland

Personalised recommendations