activity
20152026
most citedA completeness result for implicit justification stit logic

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

collaborators

13 papers

math.LO2026

Definable Classes of Models and Frames in Bi-intuitionistic Logic

Guillermo Badia, Tomasz Kowalski, Grigory Olkhovikov

The question of the expressive power of a given logical language with Kripke relational semantics has at least two dimensions: (1) what the language can say about frames, and (2) w…

math.LO2025

On connexivity in modal and conditional contexts

Grigory K. Olkhovikov

We define and axiomatize three new logics based on the connexive logic , the modal logic and the conditional logics and

math.LO2024

Conditional reasoning and the shadows it casts onto the first-order logic: the Nelsonian case

Grigory Olkhovikov

We define a natural notion of standard translation for the formulas of conditional logic which is analogous to the standard translation of modal formulas into the first-order logic…

math.LO2023

A basic system of paraconsistent Nelsonian logic of conditionals

Grigory K. Olkhovikov

We define a Kripke semantics for a conditional logic based on the propositional logic , the paraconsistent variant of Nelson's logic of strong negation; we axiomatize…

math.LO2021

Maximality of bi-intuitionistic propositional logic

Grigory Olkhovikov, Guillermo Badia

In the style of Lindström's theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive pow…

math.LO2021

A Lindström theorem for intuitionistic first-order logic

Grigory Olkhovikov, Guillermo Badia, Reihane Zoghifard

We extend the main result of (G. Badia and G. Olkhovikov. A Lindström theorem for intuitionistic propositional logic. Notre Dame Journal of Formal Logic, 61 (1): 11--30 (2020)) to…