A SHORT COURSE ON DECIDABILITY (learning propertarianism) REVERSE: In logic we s

A SHORT COURSE ON DECIDABILITY

(learning propertarianism)

REVERSE: In logic we state that a question (statement) is DECIDABLE if an algorithm (set of operations) exists within the limits of the system (rules, axioms, theories) that can produce a decision (choice).

OBVERSE: Instead, we should determine if there is a means of choosing without the need for additional information supplied from outside the system.

Or in simple terms, if DISCRETION is unnecessary.