Recognizability in pre-Heyting and well-composed logics

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this paper the problems of recognizability and strong recognizavility, perceptibility and strong perceptibility in extensions of the minimal Johansson logic J [1] are studied. These concepts were introduced in [2, 3, 4]. Although the intuitionistic logic Int is recognizable over J [2], the problem of its strong recognizability over J is not solved. Here we prove that Int is strong recognizable and strong perceptible over the minimal pre-Heyting logic Od and the minimal well-composed logic JX. In addition, we prove the perceptibility of the formula F over JX. It is unknown whether the logic J+F is recognizable over J.

Translated title of the contributionУзнаваемость в предгейтинговых и стройных логиках
Original languageEnglish
Pages (from-to)427-434
Number of pages8
JournalСибирские электронные математические известия
Volume16
DOIs
Publication statusPublished - 1 Jan 2019

OECD FOS+WOS

  • 1.01 MATHEMATICS

State classification of scientific and technological information

  • 27 MATHEMATICS

Fingerprint

Dive into the research topics of 'Recognizability in pre-Heyting and well-composed logics'. Together they form a unique fingerprint.

Cite this