David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 61 (3):347-366 (1998)
The paper is devoted to applications of algebraic logic to databases. In databases a query is represented by a formula of first order logic. The same query can be associated with different formulas. Thus, a query is a class of equivalent formulae: equivalence here being similar to that in the transition to the Lindenbaum-Tarski algebra. An algebra of queries is identified with the corresponding algebra of logic. An algebra of replies to the queries is also associated with algebraic logic. These relations lie at the core of the applications.In this paper it is shown how the theory of Halmos (polyadic) algebras (a notion introduced by Halmos as a tool in the algebraization of the first order predicate calculus) is used to create the algebraic model of a relational data base. The model allows us, in particular, to solve the problem of databases equivalence as well as develop a formal algebraic definition of a database's state description. In this paper we use the term "state description" for the logical description of the model. This description is based on the notion of filters in Halmos algebras. When speaking of a state description, we mean the description of a function which realizes the symbols of relations as real relations in the given system of data.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Marcel van De Vel (2002). Interpreting First-Order Theories Into a Logic of Records. Studia Logica 72 (3):411 - 432.
Jürg Kohlas & Robert F. Stärk (2007). Information Algebras and Consequence Operators. Logica Universalis 1 (1):139-165.
Guram Bezhanishvili & Nick Bezhanishvili (2011). An Algebraic Approach to Canonical Formulas: Modal Case. Studia Logica 99 (1-3):93-125.
Chris Brink (1989). R⌝-Algebras and R⌝-Model Structures as Power Constructs. Studia Logica 48 (1):85 - 109.
Robin Hirsch & Ian Hodkinson (1997). Step by Step-Building Representations in Algebraic Logic. Journal of Symbolic Logic 62 (1):225-279.
Daniele Mundici (1981). An Algebraic Result About Soft Model Theoretical Equivalence Relations with an Application to H. Friedman's Fourth Problem. Journal of Symbolic Logic 46 (3):523-530.
Don Pigozzi & Antonino Salibra (1995). The Abstract Variable-Binding Calculus. Studia Logica 55 (1):129 - 179.
Marcel van de Vel (2002). Interpreting First-Order Theories Into a Logic of Records. Studia Logica 72 (3):411-432.
A. Ledda, T. Kowalski & F. Paoli (2011). On Certain Quasivarieties of Quasi-MV Algebras. Studia Logica 98 (1-2):149-174.
Added to index2009-01-28
Total downloads6 ( #234,677 of 1,679,360 )
Recent downloads (6 months)1 ( #183,761 of 1,679,360 )
How can I increase my downloads?