Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T05:28:03.111Z Has data issue: false hasContentIssue false

Innocuous substitutions

Published online by Cambridge University Press:  12 March 2014

Daniel Leivant*
Affiliation:
Ohio State University, Columbus, Ohio 43210

Extract

In classical first-order predicate logic CL1 (without equality) only tautologies and antitautologies satisfy nontautological schemas. I.e., if F[p, Q] is a nontautological formula (fl) in the predicate letters shown, with p prepositional, then ⊬ F[K, Q] for any sentence K not containing some Q ∈ Q, unless ⊢ K or ⊢ ¬K. This is an easy consequence of the Completeness Theorem. Clearly, the analogous statement fails for intuitionistic predicate logic IL1; already when Q is empty: (i) ¬¬ K for, e.g., K ≡ p ∨ ¬p; (ii) ¬¬K → K for, e.g., K ≡ ¬p.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1980

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