Judgment (mathematical logic)
In mathematical logic, a judgment (or judgement) or assertion is a statement or enunciation in the metalanguage. For example, typical judgments in first-order logic would be that a string is a well-formed formula, or that a proposition is true. Similarly, a judgment may assert the occurrence of a free variable in an expression of the object language, or the provability of a proposition. In general, a judgment may be any inductively definable assertion in the metatheory.
Judgments are used 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 (thus, hypotheses and conclusions of proofs are judgments). A characteristic feature of the 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, not 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 be exploited also in foundation of type theory as well.
Logical assertion
In logic, logical assertion is a statement that asserts that a certain premise is true, and is useful for statements in proof. It is equivalent to a sequent with an empty antecedent.
For example, if p = "x is even", the implication
- [math]\displaystyle{ (\vdash p)\rightarrow(x \pmod 2 \equiv 0) }[/math]
is thus true. We can also write this using the logical assertion symbol, as
- [math]\displaystyle{ \vdash \left( (\vdash p)\rightarrow(x \pmod 2 \equiv 0) \right) }[/math]
In computer programming and programming language semantics, these are used in the form of assertions; one example is a loop invariant.
See also
References
- Martin-Löf, Per (1996). "On the meanings of the logical constants and the justifications of the logical laws". Nordic Journal of Philosophical Logic 1 (1): 11–60. https://archive-pml.github.io/martin-lof/pdfs/Meanings-of-the-Logical-Constants-1983.pdf.
- Dybjer, Peter. "Intuitionistic Type Theory". in Zalta, Edward N.. Stanford Encyclopedia of Philosophy. https://plato.stanford.edu/entries/type-theory-intuitionistic/.
- Pfenning, Frank; Davies, Rowan (August 2001). "A judgmental reconstruction of modal logic" (in en). Mathematical Structures in Computer Science 11 (4): 511–540. doi:10.1017/S0960129501003322. ISSN 1469-8072. https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/judgmental-reconstruction-of-modal-logic/975027BB7F07B59619913EAD4CEE52F4.
External links
- "Judgments in formal systems". Everything2. http://www.everything2.org/index.pl?node=Judgment.
- Pfenning, Frank (Spring 2004). "Natural Deduction". 15-815 Automated Theorem Proving. http://www.cs.cmu.edu/~fp/courses/atp/handouts/ch2-natded.pdf.
- Martin-Löf, Per (1983). "On the meaning of the logical constants and the justifications of the logical laws". Siena Lectures. http://www.cs.cornell.edu/info/Projects/Nuprl/cs671/cs671-fa99/martin.html.
 |
