On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic
Închide
Articolul precedent
Articolul urmator
507 3
Ultima descărcare din IBN:
2020-10-07 12:04
SM ISO690:2012
RUSU, Andrei; RUSU, Elena. On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic. In: Conference of Mathematical Society of the Republic of Moldova. 4, 28 iunie - 2 iulie 2017, Chişinău. Chişinău: Centrul Editorial-Poligrafic al USM, 2017, pp. 153-156. ISBN 978-9975-71-915-5.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Conference of Mathematical Society of the Republic of Moldova
4, 2017
Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chişinău, Moldova, 28 iunie - 2 iulie 2017

On existential expressibility of formulas in the simplest non-trivial super-intuitionistic propositional logic

Pag. 153-156

Rusu Andrei12, Rusu Elena3
 
1 Ovidius University, Constanța,
2 Information Society Development Institute, S.E.,
3 Technical University of Moldova
 
Proiect:
15.817.06.13A Platforma pilot pentru asigurarea evaluării calităţii şi vizualizarea conţinutului ştiinţific digital din RM
 
Disponibil în IBN: 4 octombrie 2017


Rezumat

We consider the well-known 3-valued extension of the intuitionistic propositional logic [1] and examine the conditions for o system of formulas to be complete with respect to existential expressibility of formulas considered earlier by A. V. Kuznetsov [2]. It was established that there exists a relative simple algorithm to determine whether a system of formulas is complete relative to existential expressibility of formulas in the 3-valued extension of the intuitionistic propositional logic.

Cuvinte-cheie
Intuitionistic logic,

existential expressibility, super-intuitionistic logic