On the Numbers of Minimal Tautologies and Properties of Their Proofs in Classical and Nonclassical Logic-Reference-Cited by-同舟云学术

On the Numbers of Minimal Tautologies and Properties of Their Proofs in Classical and Nonclassical Logic

Published:2019-12-25 Issue: Volume: Page:67-73
ISSN:2579-2784
Container-title:Mathematical Problems of Computer Science
language:en
Short-container-title:

Author:

Ambartsumyan Arsen¹,Gasparyan Hayk¹,Hovhannisyan Sarkis¹,Chubaryan Anahit¹

Affiliation:

1. Yerevan State University

Abstract

It is proved in this paper that the number of minimal tautologies for any given logic tautology of size п can be an exponential function in п, and it is also proved that for every tautology of the given logic there is some minimal tautology such that the number of its sequential form proof steps is equal to minimal steps in the proof of sequential form for the given tautology in cut-free sequent systems for classical, intuitionistic, Joganssons and monotone logics.

Publisher

Institute for Informatics and Automation Problems - NAS RA

Subject

General Medicine

Reference10 articles.

1. S. Cook, R. Reckhow, “The relative efficiency of propositional proofs systems”, Journal of Symbolic Logic, vol. 44, pp. 36-50, 1979.

2. A. Chubaryan, G. Petrosyan, “Frege systems are no monotonous”, Evolutio, Естественные науки, Вып. 3, 12-14, 2016.

3. A. Chubaryan, A. Khamisyan, G. Petrosyan, On Some Systems For Two Versions Of Many-Valued Logics and its Properties, Lambert Academic Publishing (LAP), 2017.

4. С. М. Саядян,.А. A. Чубарян, O свойстве немонотонности некоторых систем выводов классического исчисления высказываний, ДНАН РА, Т. 118. No 1, 20- 25, 2018.

5. Г. М. Зограбян, С. М. Саядян и А. А. Чубарян, Исследование свойства монотонности некоторых пропозициональных систем выводов классической и неклассических логик, ДНАН РА, т.119, №1, сс. 33-39, 2019.