Judgment (mathematical logic)

From Wikipedia, the free encyclopedia

For other uses, see Judgement (disambiguation).

In mathematical logic, a judgment can be for example an assertion about occurrence of a free variable in an expression of the object language, or about provability of a proposition (either as a tautology or from a given context); but judgments can be also other inductively definable assertions in the metatheory. Judgments are used for example in formalizing deduction systems: a logical axiom expresses a judgment, premises of a rule of inference are formed as a sequence of judgments, and their conclusion is a judgment as well. Also the result of a proof expresses a judgment, and the used hypotheses are formed as a sequence of judgments.

A characteristic feature of the various variants of Hilbert-style deduction systems is that the context is not changed in any of their rules of inference, while both natural deduction and sequent calculus contain some context-changing rules. Thus, if we are interested only in the derivability of tautologies, no hypothetical judgments, then we can formalize the Hilbert-style deduction system in such a way that its rules of inference contain only judgments of a rather simple form. The same cannot be done with the other two deductions systems: as context is changed in some of their rules of inferences, they cannot be formalized so that hypothetical judgments could be avoided — not even if we want to use them just for proving derivability of tautologies.

This basic diversity among the various calculi allows such difference, that the same basic thought (e.g. deduction theorem) must be proven as a metatheorem in Hilbert-style deduction system, while it can be declared explicitly as a rule of inference in natural deduction.

In type theory, some analogous notions are used as in mathematical logic (giving rise to connections between the two fields, e.g. Curry-Howard correspondence). The abstraction in the notion of judgment in mathematical logic can exploited also in foundation of type theory as well. See for example simply typed lambda calculus.