RO EN
Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic.
Authors: Rusu Andrei
– 0.10 Mb
Abstract
We consider the propositional provability intuitionistic logic IΔ, introduced by A.V. Kuznetsov [2]. We prove that there are infinitely many classes of formulas in the calculus of IΔ, which are pre-complete with respect to functional expressibility in IΔ. This result is stronger than an ealier one stated by the author in [1].E-mail: ,
Fulltext
– 0.10 Mb
Contents
- Pareto approximation of the tail by local exponential modeling.
- Classification of GL(2, ℜ)-orbit's dimensions for the differential equations' system with homogeneities of the 4th order.
- Power sets of n-ary quasigroups.
- Existence and uniqueness results for a class of nonlinear differential problems.
- Biharmonic curves in Cartan-Vranceanu (2n+1)-dimensional spaces.
- Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic.
- Linear convolution of criteria in the vector p-center problem.
- On LCA groups in which some closed subgroups have commutative rings of continuous endomorphisms.
- Multi-dimensional Darboux type differential systems with quadratic nonlinearities.
- GL(2, ℜ) -orbits in a competing species model.
- Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding.
