Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Solution of the problem of completeness with respect to expressibility in a $5$-valued nonchain extension of duality intuitionistic logic. (Russian)
Authors: Gkhaliekh Ya. H., Ratsa M. F.
Abstract
The duality intuitioniste logic has been constructed in the works of G.C.~Moisil and A.V.~Cuznetsov on the basis of intuitioniste propozitional logic to enrich it with duality operaters and with duality rule. The necessity and sufficient conditions for expressibility of all formulae in the logic of 5-valued distributive lattice with two atoms are found here. There is a discription of 20 originaly pre-complete classes of formulae in the paper.Contents
- Generalized nonlocal splines with one free generating function. Estimations of interpolation accuracy. (English)
- Stability properties of delay systems under a Taylor series representation. (English)
- Derivation of nontrivial subgroups and minimal systems of generators of point crystallographic groups by means of a computer. (Russian)
- Berge-acyclic database schemes. (Romanian)
- Frieze groups of two-sided rosette $P$-symmetries and their geometric applications. (Russian)
- Solution of the problem of completeness with respect to expressibility in a $5$-valued nonchain extension of duality intuitionistic logic. (Russian)
- Numerical analysis of a problem on wave propagation in a viscoelastic rod. (Russian)
- Construction of quasi-affine axiomatics of Lobachevskij geometry. (Russian)
- Monoquasigroups without congruences and automorphisms. (Russian)
- An algorithm for finding the minimax paths in networks. (Russian)
- A universal Turing machine with $10$ states and $3$ symbols. (Russian)
- On the $L_p$-boundedness of the resolvent operator of the Cauchy problem for a higher-order one-dimensional hyperbolic equation. (Russian)
