activity
20122026
most citedModel-theoretic characterization of intuitionistic propositional formulas

11 citations · 47 across the 20 of their papers we have counts for

collaborators

21 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.LO2023

An intuitionistically complete system of basic intuitionistic conditional logic

Grigory Olkhovikov

We introduce a basic intuitionistic conditional logic that we show to be complete both relative to a special type of Kripke models and relative to a standard trans…

math.LO2022★ 2 cited

Craig interpolation theorem fails in bi-intuitionistic predicate logic

Grigory K. Olkhovikov, Guillermo Badia

In this article we show that bi-intuitionistic predicate logic lacks the Craig Interpolation Property. We proceed by adapting the counterexample given by Mints, Olkhovikov and Urqu…

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…

math.LO2018★ 3 cited

A Lindström theorem for intuitionistic propositional logic

Guillermo Badia, Grigory Olkhovikov

It is shown that propositional intuitionistic logic is the maximal (with respect to expressive power) abstract logic satisfying a certain topological property reminiscent of compac…

math.LO2018

Restricted Interpolation and Lack Thereof in Stit Logic

Grigory K. Olkhovikov

We consider the propositional logic equipped with Chellas stit operators for a finite set of individual agents plus the historical necessity modality. We settle the question of whe…

math.LO2017

Explicit justification stit logic: a completeness result

Grigory K. Olkhovikov

We consider the explicit fragment of the basic justification stit logic introduced in earlier publications. We define a Hilbert-style axiomatic system for this logic and show that…

math.LO2017

Justification announcements in discrete time. Part II: Frame definability results

Grigory K. Olkhovikov

In Part I of this paper, we presented a Hilbert-style system axiomatizing of stit logic of justification announcements (JA-STIT) interpreted over models with discrete time st…

math.LO2017

Stit logic of justification announcements: a completeness result

Grigory Olkhovikov

We present a completeness result for a logical system which combines stit logic and justification logic in order to represent proving activity of the agents. This logic is interpre…

math.LO2017★ 1 cited

A completeness result for implicit justification stit logic

Grigory K. Olkhovikov

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restri…

math.LO2015★ 4 cited

Expressive power of basic modal intuitionistic logic as a fragment of classical FOL

Grigory Olkhovikov

The paper treats 4 different fragments of first-order logic induced by their respective versions of Kripke style semantics for modal intuitionistic logic. In order to capture these…

math.LO2015★ 7 cited

On generalized Van-Benthem-type characterizations

Grigory Olkhovikov

The paper continues the line of model-theoretic characterizations for versions of intuitionistic logic previously achieved by the author, further generalizing them. This results in…

math.LO2015

An axiomatic system for STIT imagination logic

Grigory K. Olkhovikov

We formulate a Hilbert-style axiomatic system for STIT logic of imagination recently proposed by H. Wansing and prove its completeness by the method of canonical models.

math.LO2012★ 11 cited

Model-theoretic characterization of intuitionistic propositional formulas

Grigory K. Olkhovikov

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equi…

math.LO2012

Intuitionistic predicate logic of constant domains does not have Beth property

Grigory K. Olkhovikov

Drawing on the previous work on interpolation failure, we show that Beth's definability theorem does not hold for intuitionistic predicate logic of constant domains without identit…

math.LO2012★ 11 cited

Failure of interpolation in the intuitionistic logic of constant domains

Grigori Mints, Grigory Olkhovikov, Alasdair Urquhart

This paper shows that the interpolation theorem fails in the intuitionistic logic of constant domains. This result refutes two previously published claims that the interpolation pr…

math.LO2012★ 8 cited

Model-theoretic characterization of predicate intuitionistic formulas

Grigory K. Olkhovikov

Notions of asimulation and k-asimulation introduced in [Olkhovikov, 2011] are extended onto the level of predicate logic. We then prove that a first-order formula is equivalent to…