Showing posts with label coherent logic. Show all posts
Showing posts with label coherent logic. Show all posts

Saturday, October 31, 2015

HOW TO MAKE A COHERENT VERSION OF AN APPLICATION


1. Review the entire pre-existing application.

2. Try to single-out the equal and exclusive functions of the application.

3. If not, single-out the exclusive but not always equal range of solutions for the application.

4. If not, single-out the exclusive operators of the application in terms of equivalence.

5. If not, try replacing symbols for fineness, process, decoherence, and coherence with symbols that represent these things within the old system. Use new symbols as necessary.

6. The general operation of the system can now be seen to have two major operations, assuming there are four exclusive operators: relation of A-B to C-D, and relation A-D to C-B (the dashes represent logical conjunction such as 'is the function of' or 'X quality of Y state / Y quality of X state').

7. The general system now involves selecting within the four operators to determine the operator that has most primacy. The diagram can now be rotated to select what category of system is operating, and determine the related correlations.

8. By now, you probably have an idea that some of the original data was being ignored in the operation of the original system.

9. Hopefully also, you now have an idea of how to generalize your application for the purposes of coherent philosophy!

Note: Some operations, such as a linear equation or linear parsing are not likely to have allegories within this system. Instead, they represent singular or binary relations of categories which simply scale to complexity, rather than being exponential or efficient.


Thursday, October 29, 2015

Modification of Kolmogorov’s Axioms of Probability for Coherency Theory


Original Axioms:
(1) Let P be a non-negative real number
(2) 100% probability equals 1 (note: untrue with exceptions: some truths have false conditions).
(3) That it is a finite set or function

Corollary of the original axioms: All finite probabilities can be standardized from 0 to 1.

Assumption / insight: This might be useful.

Nathan Coppedge's Modified Axioms:
(1) Begin with a category.
(2) Categories are in some way rendered equivalent subsets of the set.
(3) The set and subsets are exclusive.

Corollary of the modified axioms: Categories can express coherent sets with relative absoluteness.

Assumption / insight: Relative absoluteness, if possible, might permit objectivity and ultimately omniscience.

Saturday, September 5, 2015

Logics

Extending a theory of proof vs. unfounded, quality vs. property, opp / opp, and system / n-operator, valid vs. incompetent logics. The following is designed for a simple computer program. The most complex aspect is if you want to make the process flow better, by cataloguing all the opposites in the English language with opposite matching, so that the matching is done automatically.


1A. Is what you are considering a paradox?

{1 term: Not a paradox!

2 terms: If opposite terms: you've come to the end of knowledge!

3 terms: Exceptional paradox!

4 terms: If your terms are terms are all opposites, the answer can be absolute! If your opposite terms are in opposite positions, your problem can be stated as absolute knowledge.}

General method of Paroxysm

What is a term necessary for the problem?

Do you want to add / delete any terms?

Then the solution to paradox with terms (x, y, z ....) is the paroxysm with terms (opp x, opp y, opp z...)

Does this answer the problem?

If Y, then:

Do you want to save the solution?


1B. Is what you are considering a problem?

Do you want a general solution?

--> What is the problem?

[One word answer --> Can you be more specific (restate if necessary?)]

-->The ultimate solution to 'X Problem' is 'Opp X solution' which is short for 'a solution to Opp X'.

Was that helpful?

If no, how about a solution to Opp X? [Skip to frequent answers].


2A. Do you want help with an existing solution?

What are the two best terms of the solution? (x, y)

Is it X? No, then Y.

Is it Y? No, then X.

If it is neither, then you have a paradox [Go to Paradoxes].

If it is X and Y:

"Then you may have a problem".

Do any of the terms serve as solutions?

Yes? Then apply them!

No? Then, do you want a general solution? (above).


3A. Do you have a philosophical problem?

-->Then pick two pairs of opposites that refer to your problem.

-->Which word of the four is most important? (-->A)

-->Then quality A (B) as related to quality C (D) AND / OR quality A (D) as related to quality C (B) will constitute knowledge on the subject.


4A. Do you have a systems question?

Neutral, balanced, infinite --> Coherent.
Neutral, balanced, finite --> Modular.
Neutral, imbalanced, infinite --> Essence, History.
Neutral, imbalanced, finite --> Insight.
Asymmetric, balanced, infinite --> Degeneration.
Asymmetric, balanced, finite --> Functions.
Asymmetric, imbalanced, infinite --> Form.
Asymmetric, imbalanced, finite --> Observations.



It is also available (soon) as an academic article by the same title, at: https://www.academia.edu/15428200/Logics Seeking comments and implementation for Javascript.



ADDITIONAL NOTES:

CATEGORICAL DEDUCTION-RELATED WRITINGS


Arbitrary / Paroxysmal Deduction ('Just' Deduction):
1-d:
A then D
D then A
(A and D are opposites)
2-d:
'AB' is 'CD'
'BC' is 'DA'
'CD' is 'AB'
'DA' is 'BC'
Basically two deductions.
A and C are opposite, B and D are opposite.
similar to categorical deduction or
two-part paroxysm.
3-d:
'ABC' is 'DEF'
'BCD' is 'EFA'
'CDE' is 'FAB'
'DEF' is 'ABC'
'EFA' is 'BCD'
'FAB' is 'CDE'
Basically three deductions.
A and D are opposite.
B and E are opposite.
C and F aare opposite.
4-d: [THE NOUN THEORY WOULD APPEAR HERE BUT DOES / DID NOT APPEAR]
* https://hypercubics.blogspot.com/2016/03/on-infinite-things.html
'A conj B boolean* C conj D' OR
'A conj D boolean* C conj B'
the statement is justice of / just as:
'opp A conj opp B Opp boolean** opp C conj opp D' OR
'opp A conj opp D Opp boolean** opp C conj  opp B'
Basically four deductions.
(The opposites can be nouns or adjective forms.
C must be the opposite of A,
and D must be the opposite of B).
*(for example, 'and' / 'or' / 'always' / 'never'
'rarely' / 'usually')
*(for example, 'or' / 'and' / 'never' / 'always' /
'usually' / 'rarely')
Opp Boolean must be opposite of Boolean in this case,
so the Boolean operators cannot be neutral.


Standard Categorical Deduction:
'A conj B Neutral Boolean* C conj D'
'A conj D Neutral Boolean* C conj B'
Two deductions strictly in terms of A.
Preference is given to the first and second terms.
Otherwise determined.
The second terms retain the same logic regardless of preference.
A and C are opposite.
B and D are opposite.
Conjunction of terms is primary.
*(for example 'is' , 'as is' , 'just as' , 'when' , 'so' )


Paroxysm:
problem 'ABC...' --> solution 'oppA oppB oppC...'
similar to 3-part deduction, except quantity of terms is explicitly flexible.
again, accepts noun or adjective terms.
in this case, conjunction of terms is secondary.


Deduction Using Unconventional Opposites
complexity/perfection/arbitration/ambiguity A --->
perfection/complexity/ambiguity/arbitration opposite A
This is a hand-holding version of categorical deduction
in which specific less common comparisons are preferred
for half of the deduction.
E.g. A is equivalent here to B in standard deductions.
Opposite A is equivalent to D in standard deductions.
A selection is made between A and C, so B and D need
not be selected again.




Thursday, July 30, 2015

THE SOUL OF ABSOLUTE LOGIC

How can you resolve the nature of opposing logic?

By comparison of opposites!

And how are opposites compared?

By the only way you can!

(That is, by comparing non-opposing parts).

Sunday, February 1, 2015

The Authentic Method of 64-Category Deduction

The method has been earlier elaborated in THIS VIDEO.

But there is one thing I failed to clarify: what are the other potential four categories? After I made the video, I realized that those categories might be equally important from most points of view. Although the four original categories are important, they are not the whole picture.

So, here are the official eight categories for the 64-square diagram, with the final four categories restored:

CATEGORICAL DEDUCTION FOR 64 CATEGORIES

(1) 1A2A 3B4B
(2) 1A2B 3B4A
(3) 1B2A 3A4B
(4) 1B2B 3A4A
(5) 3A4A 1B2B
(6) 3A4B 1B2A
(7) 3B4A 1A2B
(8) 3B4B 1A2A


The four parts of each subset of the deduction refer to specific combinations of coordinates. Notice that every number has different coordinates, and each number is used just once for a given subset of the deduction. The letters are used once as well, but must remain opposite in opposite positions, as recorded above. Note that the major numbers (1,2,3,4 going with As and Bs) cycle counterclockwise, thus appearing in the modular order 1,2,4,3. This could easily be re-written for modular format by putting 4A and 4B over the 3A and 3B positions, and 3A and 3B over the 4A and 4B positions. The category numbers (1-64) however, have been recorded in modular order for the sake of objectivity. The entire set must be re-written, for which there are simpler notations, if subset numbers take cyclical order instead of modular. Modular order in my diagrams is written from upper right linearly to lower left. However, as long as it is noticed that the spatial location changes, the same system can be used for different linear-scripted writings, although it may modify the order of the major quadrants.However, the quadrants will remain counterclockwise from the starting position. For most purposes, it may be most convenient simply to imitate my methods as best you can, or to work with simpler diagrams, including the standard quadra, in which the formula is much simpler: AB:CD and AD:CB, in which neighboring letters are joined by choosing the quality of one and the noun ('property') of the other.


ACTUAL SETS FOR 64-CATEGORY CATEGORICAL DEDUCTION

These follow the sentence order of the individual categories, which involves maintaining opposites in opposite positions, and standardizing the order of the contingent categories so as to correspond with their coherent positions within the data:

1A:

1,2,10,9 | 3,4,12,11 | 28,27,19,20 | 26,25,17,18

1B:

1,2,10,9 | 3,11,12,4 | 28,27,19,20 | 26,18,17,25

2A:

5,6,14,13 | 7,8,16,15 | 32,31,23,24 | 30,29,21,22

2B:

5,6,14,13 | 7,15,16,8 | 32,31,23,24 | 30,22,21,29

3A:

64,63,55,56 | 62,61,53,54 | 37,38,46,45 | 39,40,48,47

3B:

64,63,55,56 | 62,54,53,61 | 37,38,46,45 | 39,47,48,40

4A:

60,59,51,52 | 58,57,49,50 | 33,34,42,41 | 35,36,44,43

4B:

60,59,51,52 | 58,50,49,57 | 33,34,42,41 | 35,43,44,36




















ABOVE: A 64-Category Diagram Following Modular Order. Notice that in modular order every position in quadrant A (upper right) is opposite to every category in quadrant C (lower left). Also, every category in quadrant B (upper left) is opposite of every category in quadrant D (lower right). This is not true with every set ordering, but only with cases where the order proceeds across the entire (square) diagram from the first position, and ending in the last. Two other potential orderings include numbering individual sub-cycles in cyclical order, or proceeding linearly, but adapted to the cycle of the diagram. Thus, 1,2,10,9 would instead appear 1,2,3,4, or in the next case 27,28,36,35 would instead appear 6,2,1,5, since the enumeration would begin in the center near the mote, and proceed contingently to the motion of the cycle. But those are alternate methods. Modular order is in some ways preferable, although in some cases it is simpler to explain in terms of sub-cycles.

Saturday, December 20, 2014

Over 4200 views to my academic articles

at AcademicRoom.com.

Link to my profile HERE.


Monday, October 13, 2014

Coherent Logic by Nathan Coppedge

BOOK DESCRIPTION

This short treatise is a guide to insights on two- and three-valued logic. More importantly, it introduces the associated coherent systeme of Nathan Coppedge, inventor of the coherent categorical deduction, and philosophical paroxysm or double-paradox. The book is designed to yield insights into objective knowledge, non-causal inference, and coherent systems.


It is available now at Amazon HERE (e-book will be linked with the text page soon enough).