Failing to fetch me at first keep encouraged,
Missing me one place search another,
I stop some where waiting for you

— Walt Whitman • Leaves of Grass

Life on Easy Street

The finite character of the extended universe makes the task of solving differential propositions relatively straightforward.  The solution set of the differential proposition is the set of models in   Finding all models of the extended interpretations in which satisfy can be carried out by a finite search.

Being in possession of complete algorithms for propositional calculus modeling, theorem checking, and theorem proving makes the analytic task fairly simple in principle, even if the question of efficiency in the face of arbitrary complexity remains another matter entirely.

The NP‑completeness of propositional satisfiability may weigh against the prospects of a single efficient algorithm capable of covering the whole space with equal facility but there appears to be much room for improvement in classifying special forms and developing algorithms tailored to their practical processing.

Resources

• Differential Logic and Dynamic Systems
• Differential Logic • Life on Easy Street

cc: Academia.edu • Cybernetics • Structural Modeling • Systems Science
cc: Conceptual Graphs • Laws of Form • Ma^thstodon • Research Gate