Green's Logical Inclusion Theorem
- Green's Logical Inclusion Theorem
Green's Logical Inclusion Theorem, also known as the belief of Logical Inclusion, is the assertion that all monotheistic religious schools of thought, regardless location in the world or any other belief criterion, are worshiping and/or praying to the same 'higher power.' This theorem draws from the same vein as Nondualism and Monism and is closely related as such. However, Green's Logical Inclusion Theorem should not be grouped with New Age or New Thought principles, as it is objective rather than a subset of some other belief structure. The theorem itself grew from an ongoing dialog amongst researcher Ryan Green and his colleagues on the interconnectivity and overlapping of major world religions in the setting of propositional logic. Logical Inclusion has been used in enrichment activities as an exercise in critical thought.
Wikimedia Foundation.
2010.
Look at other dictionaries:
Set (mathematics) — This article gives an introduction to what mathematicians call intuitive or naive set theory; for a more detailed account see Naive set theory. For a rigorous modern axiomatic treatment of sets, see Set theory. The intersection of two sets is… … Wikipedia
Logic programming — is, in its broadest sense, the use of mathematical logic for computer programming. In this view of logic programming, which can be traced at least as far back as John McCarthy s [1958] advice taker proposal, logic is used as a purely declarative… … Wikipedia
Logic — For other uses, see Logic (disambiguation). Philosophy … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… … Wikipedia
Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… … Wikipedia
