Searcharxiv⌕ Search

arXiv subjects

Oleg Grigoriev

Publications and source records attributed to Oleg Grigoriev.

3 recordsLinked to original sources

Relational Semantics and Completeness for Onto-Epistemic Logic

This paper investigates a relational semantics for onto-epistemic logic with two semi-negations. The frames carry two pairs of quasi-orders and two commuting involutions. Some frames have nondistributive lattices of stable sets. The four- and nine-valued entailments are recovered as joint entailment on two particular finite frames. Sound and complete binary consequence calculi are given for both component entailments and for joint entailment. The joint Lindenbaum algebra embeds subdirectly into the product of its two component quotients. This embedding shows that joint derivability is the intersection of the two component derivability relations. The finite model property is proved using Dedekind-MacNeille completion and a filter-ideal representation of the resulting lattice. All three entailments are decidable by interleaving the search for a derivation with the search for a finite countermodel.

math.LO↗

Cyclic Negations and Four-valuedness

We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we consider a representation of so called square root of negation within this four valued semantics as an operation which acts like a cycling negation. We define two variants of logical matrices performing different orders over the set of truth values. Purely formal logical result of our study consists in axiomatizing the logics of defined matrices as the systems of binary consequence relation and proving correctness and completeness theorems for these deductive systems.

cs.LO↗

On capacity computation for symmetric polygonal condensers

Making use of two different analytical-numerical methods for capacity computation, we obtain matching to a very high precision numerical values for capacities of a wide family of planar condensers. These two methods are based respectively on the use of the Lauricella function and Riemann theta functions. We apply these results to benchmark the performance of numerical algorithms, which are based on adaptive $hp$--finite element method and boundary integral method.

math.NA↗