One type of formal negationless systems
type: Item
instance of: scholarly article
title: One type of formal negationless systems
zbMATH Open document ID: 0599.03023
published in: Moscow University Mathematics Bulletin
publication date: 1984-01-01T00:00:00Z
review text: A system of negationless predicate calculus (NPC) is formulated by a two- step procedure. First, a basis system (BS) is presented, then a criterion is given for identifying NPC-permissible deductions in BS. Intuitively, a deduction is NPC-permissible iff there are, in the intuitionistic sense, objects satisfying the conditions described by the premisses. This becomes the requirement that it be a theorem of BS that there are such objects. A Kripke semantics for NPC is given for which soundness and completeness is claimed, but not proved.
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 03B55
Mathematics Subject Classification ID: 03B20
zbMATH DE Number: 3966033
zbMATH Keywords: intuitionistic logic
zbMATH Keywords: negationless predicate calculus
zbMATH Keywords: Kripke semantics
author: Victor N. Krivtsov
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3966033