Scottish Rite (Masonic Order) French Language Collection, 1787-1825, 1907, n.d.

The origins of the Scottish Rite of Freemasonry can be traced to France around 1754, when a Chapter of Claremont was founded in Paris. Initially this chapter had seven degrees, but by 1758 there were twenty-five degrees, known as the Rite of Perfection. In 1761, Stephen Morin was appointed to introduce the Rite into the New World. He began with Kingston, Jamaica and San Domingo. Further establishments were made in New Orleans, LA(1763); Albany, NY (1767); Philadelphia, PA (1782); and Charleston, SC (1783). In order to improve the disorganized state of the degrees in Europe, “Grand Constitutions” were enacted in 1786. These Constitutions formally brought into existence the “Ancient and Accepted Scottish Rite”. None of the degrees of the Scottish Rite would seem to have origins in Scotland. “Scottish” is translated from the French word “Ecossais”, which is found in some of the French titles of some of the degrees of the Rite of Perfection. It is possible that the Scottish connection is a result of the involvement of a Scotsman, Andrew Michael Ramsey, who may have devised some of the degrees.

L-Fuzzy Structured Query Language

Lattice valued fuzziness is more general than crispness or fuzziness based on the unit interval. In this work, we present a query language for a lattice based fuzzy database. We define a Lattice Fuzzy Structured Query Language (LFSQL) taking its membership values from an arbitrary lattice L. LFSQL can handle, manage and represent crisp values, linear ordered membership degrees and also allows membership degrees from lattices with non-comparable values. This gives richer membership degrees, and hence makes LFSQL more flexible than FSQL or SQL. In order to handle vagueness or imprecise information, every entry into an L-fuzzy database is an L-fuzzy set instead of crisp values. All of this makes LFSQL an ideal query language to handle imprecise data where some factors are non-comparable. After defining the syntax of the language formally, we provide its semantics using L-fuzzy sets and relations. The semantics can be used in future work to investigate concepts such as functional dependencies. Last but not least, we present a parser for LFSQL implemented in Haskell.