Results for 'Dependence logic'

951 found
Order:
  1.  66
    Dependence logic: a new approach to independence friendly logic.Jouko Väänänen - 2007 - New York: Cambridge University Press.
    Dependence is a common phenomenon, wherever one looks: ecological systems, astronomy, human history, stock markets - but what is the logic of dependence? This book is the first to carry out a systematic logical study of this important concept, giving on the way a precise mathematical treatment of Hintikka’s independence friendly logic. Dependence logic adds the concept of dependence to first order logic. Here the syntax and semantics of dependence logic (...)
    Direct download  
     
    Export citation  
     
    Bookmark   51 citations  
  2.  46
    Complexity Results for Modal Dependence Logic.Peter Lohmann & Heribert Vollmer - 2013 - Studia Logica 101 (2):343-366.
    Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator = (). For propositional variables p 1, . . . , p n , = (p 1, . . . , p n-1, p n ) intuitively states that the value of p n is determined by those of p 1, . . . , p n-1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence (...) is complete for nondeterministic exponential time.In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfiability for poor man’s dependence logic, the language consisting of formulas built from literals and dependence atoms using ${\wedge, \square, \lozenge}$ (i. e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness.We also extend Väänänen’s language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satisfiability is complete for the second level of the polynomial hierarchy. Additionally we consider the restriction of modal dependence logic where the length of each single dependence atom is bounded by a number that is fixed for the whole logic. We show that the satisfiability problem for this bounded arity dependence logic is PSPACE-complete and that the complexity drops to the third level of the polynomial hierarchy if we then disallow disjunction.In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by Väänänen and Sevenster. (shrink)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  3. On definability in dependence logic.Juha Kontinen & Jouko Väänänen - 2009 - Journal of Logic, Language and Information 18 (3):317-332.
    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.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  4.  27
    Dependence Logic with a Majority Quantifier.Arnaud Durand, Johannes Ebbing, Juha Kontinen & Heribert Vollmer - 2015 - Journal of Logic, Language and Information 24 (3):289-305.
    We study the extension of dependence logic \ by a majority quantifier \ over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers of all arities. Our results imply that, from the point of view of descriptive complexity theory, \\) captures the complexity class counting hierarchy. We also obtain characterizations of the individual levels of the counting hierarchy by fragments of \\).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  24
    Modal dependence logics: axiomatizations and model-theoretic properties.Fan Yang - 2017 - Logic Journal of the IGPL 25 (5):773-805.
  6. Generalized Quantifiers in Dependence Logic.Fredrik Engström - 2012 - Journal of Logic, Language and Information 21 (3):299-324.
    We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  7.  94
    Epistemic Operators in Dependence Logic.Pietro Galliani - 2013 - Studia Logica 101 (2):367-397.
    The properties of the ${\forall^{1}}$ quantifier defined by Kontinen and Väänänen in [13] are studied, and its definition is generalized to that of a family of quantifiers ${\forall^{n}}$ . Furthermore, some epistemic operators δ n for Dependence Logic are also introduced, and the relationship between these ${\forall^{n}}$ quantifiers and the δ n operators are investigated.The Game Theoretic Semantics for Dependence Logic and the corresponding Ehrenfeucht- Fraissé game are then adapted to these new connectives.Finally, it is proved (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  8.  52
    Dependence Logic: A survey of some recent work.Juha Kontinen - 2013 - Philosophy Compass 8 (10):950-963.
    Dependence logic and its many variants are new logics that aim at establishing a unified logical theory of dependence and independence underlying seemingly unrelated subjects. The area of dependence logic has developed rapidly in the past few years. We will give a short introduction to dependence logic and review some of the recent developments in the area.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  92
    Expressing Second-order Sentences in Intuitionistic Dependence Logic.Fan Yang - 2013 - Studia Logica 101 (2):323-342.
    Intuitionistic dependence logic was introduced by Abramsky and Väänänen [1] as a variant of dependence logic under a general construction of Hodges’ (trump) team semantics. It was proven that there is a translation from intuitionistic dependence logic sentences into second order logic sentences. In this paper, we prove that the other direction is also true, therefore intuitionistic dependence logic is equivalent to second order logic on the level of sentences.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  10.  56
    The Dynamification of Modal Dependence Logic.Pietro Galliani - 2013 - Journal of Logic, Language and Information 22 (3):269-295.
    We examine the transitions between sets of possible worlds described by the compositional semantics of Modal Dependence Logic, and we use them as the basis for a dynamic version of this logic. We give a game theoretic semantics, a (compositional) transition semantics and a power game semantics for this new variant of modal Dependence Logic, and we prove their equivalence; and furthermore, we examine a few of the properties of this formalism and show that Modal (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  32
    Dependence logic in pregeometries and ω-stable theories.Gianluca Paolini & Jouko Väänänen - 2016 - Journal of Symbolic Logic 81 (1):32-55.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  12
    Focal Dependence, Logical Priority and the Unity of Aristotle’s Metaphysics.Gastón Robert - 2021 - Kriterion: Journal of Philosophy 62 (148):7-27.
    RESUMO Um problema de longa data na erudição aristotélica diz respeito à questão de como reconciliar a dupla descrição de Aristóteles da metafísica como ontologia (a ciência universal do ser enquanto ser) e teologia (a ciência da substância imutável e separada). Uma tentativa importante de responder a esta questão (iniciada primeiro por G. Patzig) consiste em dizer que a substância imutável e separada é focalmente anterior (ou o significado focal da) substância e, portanto, de ser em geral (uma vez que (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. (1 other version)Dependence logic: A new approach to independence friendly logic – by Jouko Väänänen.Gabriel Sandu - 2009 - Theoria 75 (1):52-64.
  14.  66
    Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas.Jarmo Kontinen - 2013 - Studia Logica 101 (2):267-291.
    We study the computational complexity of the model checking problem for quantifier-free dependence logic ${(\mathcal{D})}$ formulas. We characterize three thresholds in the complexity: logarithmic space (LOGSPACE), non-deterministic logarithmic space (NL) and non-deterministic polynomial time (NP).
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  15.  61
    Characterizing Quantifier Extensions of Dependence Logic.Fredrik Engström & Juha Kontinen - 2013 - Journal of Symbolic Logic 78 (1):307-316.
    We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quanti ers in terms of quanti er extensions of existential second-order logic.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  16.  70
    Axiomatizing first-order consequences in dependence logic.Juha Kontinen & Jouko Väänänen - 2013 - Annals of Pure and Applied Logic 164 (11):1101-1117.
    Dependence logic, introduced in Väänänen [11], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  17. Sequents for dependence logics.Luis Fariñas del Cerro & Val Erie Lugardon - 1991 - Logique Et Analyse 133 (134):55-71.
  18.  88
    Transition semantics: the dynamics of dependence logic.P. Galliani - 2014 - Synthese 191 (6):1249-1276.
    We examine the relationship between dependence logic and game logics. A variant of dynamic game logic, called Transition Logic, is developed, and we show that its relationship with dependence logic is comparable to the one between first-order logic and dynamic game logic discussed by van Benthem. This suggests a new perspective on the interpretation of dependence logic formulas, in terms of assertions about reachability in games of imperfect information against Nature. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  19. Jeremy Butterfield.Outcome Dependence & Stochastic Einstein Nonlocaljty - 1994 - In Dag Prawitz & Dag Westerståhl (eds.), Logic and Philosophy of Science in Uppsala: Papers From the 9th International Congress of Logic, Methodology and Philosophy of Science. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 385.
    No categories
     
    Export citation  
     
    Bookmark  
  20.  56
    A Remark on Negation in Dependence Logic.Juha Kontinen & Jouko Väänänen - 2011 - Notre Dame Journal of Formal Logic 52 (1):55-65.
    We show that for any pair $\phi$ and $\psi$ of contradictory formulas of dependence logic there is a formula $\theta$ of the same logic such that $\phi\equiv\theta$ and $\psi\equiv\neg\theta$. This generalizes a result of Burgess.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  21. Sequents for dependence logic.L. Fariñas del Cerro & V. Lugardon - forthcoming - Logique Et Analyse.
  22. Compositional Natural Language Semantics using Independence Friendly Logic or Dependence Logic.Theo M. V. Janssen - 2013 - Studia Logica 101 (2):453-466.
    Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics. In this contribution we will compare these two logics by investigating their application in a (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  63
    Questions and Dependency in Intuitionistic Logic.Ivano Ciardelli, Rosalie Iemhoff & Fan Yang - 2020 - Notre Dame Journal of Formal Logic 61 (1):75-115.
    In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and dependencies to this classical core. In this paper, we broaden the scope of these investigations by studying questions and dependency in the context of intuitionistic logic. We propose an intuitionistic team semantics, where (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  24. Coherence and complexity of quantifier-free dependence logic formulas.Jarmo Kontinen - forthcoming - Studia Logica.
  25.  25
    On Natural Deduction in Dependence Logic[REVIEW]Juha Kontinen - 2015 - In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. Boston: De Gruyter. pp. 297-304.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  39
    On intermediate inquisitive and dependence logics: An algebraic study.Davide Emilio Quadrellaro - 2022 - Annals of Pure and Applied Logic 173 (10):103143.
  27.  27
    The Expressive Power of Modal Dependence Logic.Lauri Hella, Kerkko Luosto, Katsuhiko Sano & Jonni Virtema - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10: Papers From the Tenth Aiml Conference, Held in Groningen, the Netherlands, August 2014. London, England: CSLI Publications. pp. 294-312.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  28.  40
    Dependences between logic and community: Philosophical implications of Peirce's categories for Praxis.Jordi Graupera - 2011 - Ramon Llull Journal of Applied Ethics 2 (2):179.
    The purpose of this paper is to analyse the possible implications of Peirce's categories for a project of a community. In order to do so, I will start by analysing the first formulation of these categories in Peirce's early writings, and then I will compare them with their later formulations. Thus, we will see some their most important characteristics, namely, their universality and their dynamism, which will allow for a particular understanding of the role that logic can play in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  98
    A Simple Logic of Functional Dependence.Alexandru Baltag & Johan van Benthem - 2021 - Journal of Philosophical Logic 50 (5):939-1005.
    This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  30. The Logic of Approximate Dependence.Jouko Väänänen - 2017 - In Ramaswamy Ramanujam, Lawrence Moss & Can Başkent (eds.), Rohit Parikh on Logic, Language and Society. Cham, Switzerland: Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark  
  31.  60
    Erratum to: On Definability in Dependence Logic[REVIEW]Jouko Väänänen - 2011 - Journal of Logic, Language and Information 20 (1):133-134.
  32.  52
    Propositional logics of dependence.Fan Yang & Jouko Väänänen - 2016 - Annals of Pure and Applied Logic 167 (7):557-589.
  33.  46
    Time dependent propositions and quantum logic.Peter Mittelstaedt - 1977 - Journal of Philosophical Logic 6 (1):463 - 472.
    Compound propositions which can successfully be defended in a quantumdialogue independent of the elementary propositions contained in it, must have this property also independent of the mutual elementary commensur-abilities. On the other hand, formal commensurabilities must be taken into account. Therefore, for propositions which can be proved by P, irrespective of both the elementary propositions and of the elementary commensur-abilities, there exists a formal strategy of success. The totality of propositions with a formal strategy of success in a quantum dialogue (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  34.  56
    Structural completeness in propositional logics of dependence.Rosalie Iemhoff & Fan Yang - 2016 - Archive for Mathematical Logic 55 (7-8):955-975.
    In this paper we prove that three of the main propositional logics of dependence, none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed. We obtain an analogous result with respect to stable substitutions, for the negative variants of some well-known intermediate logics, which are intermediate theories that are closely related to inquisitive logic.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  35. Dependence and Independence.Erich Grädel & Jouko Väänänen - 2013 - Studia Logica 101 (2):399-410.
    We introduce an atomic formula ${\vec{y} \bot_{\vec{x}}\vec{z}}$ intuitively saying that the variables ${\vec{y}}$ are independent from the variables ${\vec{z}}$ if the variables ${\vec{x}}$ are kept constant. We contrast this with dependence logic ${\mathcal{D}}$ based on the atomic formula = ${(\vec{x}, \vec{y})}$ , actually equivalent to ${\vec{y} \bot_{\vec{x}}\vec{y}}$ , saying that the variables ${\vec{y}}$ are totally determined by the variables ${\vec{x}}$ . We show that ${\vec{y} \bot_{\vec{x}}\vec{z}}$ gives rise to a natural logic capable of formalizing basic intuitions about (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   50 citations  
  36. Relational logics for formalization of database dependencies.Wojciech Buszkowski & Ewa Orlowska - 1998 - Bulletin of the Section of Logic 27.
     
    Export citation  
     
    Bookmark  
  37.  18
    A Logical Theory of Dependence.Kurt Grelling - 1939 - Journal of Symbolic Logic 4 (4):169-169.
  38.  60
    Complementarity, context dependence, and quantum logic.Patrick A. Heelan - 1970 - Foundations of Physics 1 (2):95-110.
    Quantum-mechanical event descriptions are context-dependent descriptions. The role of quantum (nondistributive) logic is in the partial ordering of contexts rather than in the ordering of quantum-mechanical events. Moreover, the kind of quantum logic displayed by quantum mechanics can be easily inferred from the general notion of contextuality used in ordinary language. The formalizable core of Bohr's notion of complementarity is the type of context dependence discussed in this paper.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  39.  92
    Against the Judgment-Dependence of Mathematics and Logic.Alexander Paseau - 2012 - Erkenntnis 76 (1):23-40.
    Although the case for the judgment-dependence of many other domains has been pored over, surprisingly little attention has been paid to mathematics and logic. This paper presents two dilemmas for a judgment-dependent account of these areas. First, the extensionality-substantiality dilemma: in each case, either the judgment-dependent account is extensionally inadequate or it cannot meet the substantiality condition (roughly: non-vacuous specification). Second, the extensionality-extremality dilemma: in each case, either the judgment-dependent account is extensionally inadequate or it cannot meet the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  40.  11
    Seeing negation as always dependent frees mathematical logic from paradox, incompleteness, and undecidability-- and opens the door to its positive possibilities.Daniel A. Cowan - 2008 - San Mateo, CA: Joseph Publishing Company.
  41.  6
    Dependency semantics for sequences of extended logic programs.P. Krumpelmann - 2012 - Logic Journal of the IGPL 20 (5):943-966.
  42.  41
    Evidence that logical reasoning depends on conscious processing.C. Nathan DeWall, Roy F. Baumeister & E. J. Masicampo - 2008 - Consciousness and Cognition 17 (3):628-645.
    Humans, unlike other animals, are equipped with a powerful brain that permits conscious awareness and reflection. A growing trend in psychological science has questioned the benefits of consciousness, however. Testing a hypothesis advanced by [Lieberman, M. D., Gaunt, R., Gilbert, D. T., & Trope, Y. . Reflection and reflexion: A social cognitive neuroscience approach to attributional inference. Advances in Experimental Social Psychology, 34, 199–249], four studies suggested that the conscious, reflective processing system is vital for logical reasoning. Substantial decrements in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  43.  54
    Independendly‐Friendly Logic: Dependence and Independence of Quantifiers in Logic.Gabriel Sandu - 2012 - Philosophy Compass 7 (10):691-711.
    Independence‐Friendly logic introduced by Hintikka and Sandu studies patterns of dependence and independence of quantifiers which exceed those found in ordinary first‐order logic. The present survey focuses on the game‐theoretical interpretation of IF‐logic, including connections to solution concepts in classical game theory, but we shall also present its compositional interpretation together with its connections to notions of dependence and dependence between terms.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  44.  32
    Complete Logics for Elementary Team Properties.Juha Kontinen & Fan Yang - forthcoming - Journal of Symbolic Logic:1-41.
    In this paper, we introduce a logic based on team semantics, called $\mathbf {FOT} $, whose expressive power is elementary, i.e., coincides with first-order logic both on the level of sentences and (possibly open) formulas, and we also show that a sublogic of $\mathbf {FOT} $, called $\mathbf {FOT}^{\downarrow } $, captures exactly downward closed elementary (or first-order) team properties. We axiomatize completely the logic $\mathbf {FOT} $, and also extend the known partial axiomatization of dependence (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. Anaphoric Dependence and Logical Form.Manuel García-Carpintero - 2020 - Disputatio 12 (58):265-276.
    In the core chapters 4–6, Iacona (2018) argues against the “Uniqueness Thesis” (UT), stating that “there is a unique notion of logical form that fulfils both the logical role and the semantic role” (39), where the former “concerns the formal explanation of logical properties and logical relations, such as validity or contradiction” (37), and the latter “concerns the formulation of a compositional theory of meaning” (ibid.). He argues for this on the basis of relations of coreference among referential expressions, names (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  33
    Negation and partial axiomatizations of dependence and independence logic revisited.Fan Yang - 2019 - Annals of Pure and Applied Logic 170 (9):1128-1149.
    In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in [22] and [11]. We prove a characterization theorem for negatable formulas in independence logic and negatable sentences in dependence logic, and identify an interesting class of formulas that are negatable in independence logic. Dependence and independence atoms, first-order formulas belong to this class. We also demonstrate our extended system (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  47.  26
    Organising Stakeholder Participation in Global Climate Governance: The Effects of Resource Dependency and Institutional Logics in the Green Climate Fund.Jonas Bertilsson - 2023 - Environmental Values 32 (5):555-577.
    Public or stakeholder participation in environmental governance has been strongly advocated within the United Nations (UN) since the early 1990s. A relatively new mechanism for global climate finance that emphasises stakeholder engagement is the Green Climate Fund (GCF), a UN strategy for channelling funds from the Global North to the Global South. Drawing on previous critical approaches to multi-stakeholder involvement in global governance, this article explores stakeholder involvement within the GCF. The study combines ideas from institutional logics and resource dependency (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  28
    Characterising nested database dependencies by fragments of propositional logic.Sven Hartmann & Sebastian Link - 2008 - Annals of Pure and Applied Logic 152 (1):84-106.
    We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It is shown that these equivalences are still valid for the databases that store complex data elements obtained from the recursive nesting of record, list, set and multiset constructors. The major proof argument utilises properties of Brouwerian algebras.The equivalences have several consequences. Firstly, they provide new insights into databases that are not in first normal (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  49.  26
    Uncertainty and dependence in classical and quantum logic—the role of triangular norms.Mirko Navara & Pavel Pták - 1999 - In Maria Luisa Dalla Chiara (ed.), Language, Quantum, Music. Springer. pp. 249--261.
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  54
    Functional dependencies, supervenience, and consequence relations.I. L. Humberstone - 1993 - Journal of Logic, Language and Information 2 (4):309-336.
    An analogy between functional dependencies and implicational formulas of sentential logic has been discussed in the literature. We feel that a somewhat different connexion between dependency theory and sentential logic is suggested by the similarity between Armstrong's axioms for functional dependencies and Tarski's defining conditions for consequence relations, and we pursue aspects of this other analogy here for their theoretical interest. The analogy suggests, for example, a different semantic interpretation of consequence relations: instead of thinking ofB as a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
1 — 50 / 951