Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T12:37:47.328Z Has data issue: false hasContentIssue false

Rules of inference with parameters for intuitionistic logic

Published online by Cambridge University Press:  12 March 2014

Vladimir V. Rybakov*
Affiliation:
Department of Mathematics, Krasnoyarsk State University, 660062 Krasnoyarsk, USSR

Abstract

An algorithm recognizing admissibility of inference rules in generalized form (rules of inference with parameters or metavariables) in the intuitionistic calculus H and, in particular, also in the usual form without parameters, is presented. This algorithm is obtained by means of special intuitionistic Kripke models, which are constructed for a given inference rule. Thus, in particular, the direct solution by intuitionistic techniques of Friedman's problem is found. As a corollary an algorithm for the recognition of the solvability of logical equations in H and for constructing some solutions for solvable equations is obtained. A semantic criterion for admissibility in H is constructed.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1992

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