Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-12T11:01:38.201Z Has data issue: false hasContentIssue false

Non-null implication1

Published online by Cambridge University Press:  12 March 2014

David Nelson*
Affiliation:
The George Washington University, Washington, D.C.

Extract

An implication A ⊃ B is said to be null in case A is false in all instances. This note describes several formal systems for first-order predicate logic and arithmetic in which null implications do not occur. In fact, the most restrictive systems avoid the occurrences of any formulas which represent null predicates. The precise sense of this avoidance is explained below.

An intuitionistic negation is a statement of the form A ⊃ F where F is a contradiction. The absence of null implications among true statements entails the absence of intuitionistic negations, and hence systems described here might be called negationless intuitionistic systems.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable