Search results for: Alexander Belikov
article
The relationship between formal (standard) logic and informal (common-sense, everyday) reasoning has always been a hot topic. In this paper, we propose another possible way to bring it up inspired by connexive logic. Our approach is based on the following presupposition: whatever method of formalizing informal reasoning you choose, there will always be some classically acceptable deductive principles...
article
Journal of Philosophical Logic > 2019 > 48 > 5 > 787-808
In this paper we present a solution of the axiomatization problem for the Fmla-Fmla versions of the Pietz and Rivieccio exactly true logic and the non-falsity logic dual to it. To prove the completeness of the corresponding binary consequence systems we introduce a specific proof-theoretic formalism, which allows us to deal simultaneously with two consequence relations within one logical system. These...
article
Studia Logica > 2017 > 105 > 6 > 1291-1317
We consider a family of logical systems for representing entailment relations of various kinds. This family has its root in the logic of first-degree entailment formulated as a binary consequence system, i.e. a proof system dealing with the expressions of the form $$\varphi \vdash \psi $$ φ ⊢ ψ , where both $$\varphi $$ φ and $$\psi $$ ψ are single formulas. We generalize...
chapter
Three examples of problems of analytical learning as standardizated elements for design multy-layers neural network with any complicated configuration of input-output vector-function are consider. Solutions for synaptic weight coefficients (SWC) as recurrent sequence are represented in analytic form. Convergence of recurrent approximation for two schemes of approaches by a linear and quadratic curve...
chapter
This paper reviews the building of information systems based on the principle of connected workstations. An approach to automatized building of workplaces based on business processes is proposed. The theory of graphs is considered as formalization of this approach.
