Studia Logica 66 (2):273-283 (2000)

Authors
Abstract
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
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1005200414624
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,512
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Explicating Logical Independence.Lloyd Humberstone - 2020 - Journal of Philosophical Logic 49 (1):135-218.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
40 ( #285,921 of 2,520,895 )

Recent downloads (6 months)
1 ( #405,457 of 2,520,895 )

How can I increase my downloads?

Downloads

My notes