Evaluate Proposition #2
Labels
No labels
type
bug
type
feature
type
overhaul
type
testing
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set.
Reference
bemmesr/liblogic#2
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Introduce a function which when given a proposition will determine if it is:
This should pass given that there are tests showing that propositions of varying complexity are correctly identified as being one of the three. In these tests there should be one example of each of the above types of proposition for each combination of the basic connectives.
evaluatePropositionto Evaluate PropositionPossible to also test by first creating a random contradictory proposition (which evaluates as such) and then negating it and seeing if the result is determined to be a tautology (if not, there is an error). Similar test can be applied by first generating a tautology and negating it. As for a random contingent proposition, we can test it by putting it in conjunction with its negation and seeing if the result is evaluated as a contradiction, and likewise we can test it by putting it in disjunction with its negation and seeing if the result is evaluated as a tautology. All this requires that the proposition data type be sufficiently flexible so as to easily use one proposition in another.