School of Computer Science and Information TechnologyUniversity of Nottingham
Cite this article as:
Alechina, N. Studia Logica (2000) 66: 273. doi:10.1023/A:1005200414624
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.