activity
20242026
most citedA Binary Quantifier for Definite Descriptions in Nelsonian Free Logic

1 citations · 1 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LO2026

Essence and accident modalities meet Belnapian truth values

Yaroslav Petrukhin

This paper investigates many-valued generalisations of the classical essence and accident modalities. In two-valued logic, a proposition is essentially true (resp. false) if, whene…

cs.LO2026

On Three-Valued Dependence-Like Logics

Yaroslav Petrukhin

In this paper, we investigate connections between dependence logics, viewed as a subclass of relating logics, and three-valued logics. More specifically, we identify common feature…

cs.LO2025

On a Second-Order Version of Russellian Theory of Definite Descriptions

Yaroslav Petrukhin

Definite descriptions are first-order expressions that denote unique objects. In this paper, we propose a second-order counterpart, designed to refer to unique relations between ob…

cs.LO2024★ 1 cited

A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic

Yaroslav Petrukhin

The method Kürbis used to formalise definite descriptions with a binary quantifier I, such that I indicates `the F is G', is examined and improved upon in this work. Kürbis…

cs.LO2024

Bisequent Calculi for Neutral Free Logic with Definite Descriptions

Andrzej Indrzejczak, Yaroslav Petrukhin

We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no trut…

cs.LO2024

Uniform Cut-free Bisequent Calculi for Three-valued Logics

Andrzej Indrzejczak, Yaroslav Petrukhin

We present a uniform characterisation of three-valued logics by means of the bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on th…