Complete inference system

An inference system A is complete with respect to another system B if A can reach every conclusion which is true in B. The dual to completeness is soundness.


Read Also:

  • Complete lattice

    A lattice is a partial ordering of a set under a relation where all finite subsets have a least upper bound and a greatest lower bound. A complete lattice also has these for infinite subsets. Every finite lattice is complete. Some authors drop the requirement for greatest lower bounds. (1994-12-02)

  • Completely

    [kuh m-pleet] /kəmˈplit/ adjective 1. having all parts or elements; lacking nothing; whole; entire; full: a complete set of Mark Twain’s writings. 2. finished; ended; concluded: a complete orbit. 3. having all the required or customary characteristics, skills, or the like; consummate; perfect in kind or quality: a complete scholar. 4. thorough; entire; total; undivided, […]

  • Completely-normal-space

    noun, Mathematics. 1. a normal topological space in which every subspace is normal.

  • Completely-regular-space

    noun, Mathematics. 1. a topological space in which, for every point and a closed set not containing the point, there is a continuous function that has value 0 at the given point and value 1 at each point in the closed set.

Disclaimer: Complete inference system definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.