RECURSIVE RELATIONSHIPS AND NATURAL QUANTIFIER SET THEORETIC EXPRESSION TECHNIQUES
dc.contributor.author | Bradley, James | eng |
dc.date.accessioned | 2008-02-27T22:59:16Z | |
dc.date.available | 2008-02-27T22:59:16Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1988-04-01 | eng |
dc.description.abstract | A set theoretic expression technique that uses natural quantifiers and sets of related tuples has been extended to include recursive relationships. The technique includes formal set theoretic specifications of related sets of tuples that are related in any of the subrelationships of a recursive relationship. The technique covers both recursive one-to-many and recursive many-to-many relationships. The technique provides a set theoretic foundation for data base languages that allow for the use of the natural quantifiers. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1988-304-16 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30459 | |
dc.identifier.uri | http://hdl.handle.net/1880/46295 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | RECURSIVE RELATIONSHIPS AND NATURAL QUANTIFIER SET THEORETIC EXPRESSION TECHNIQUES | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |