16 found
Order:
Disambiguations
Grigory K. Olkhovikov [12]Grigory Olkhovikov [4]
  1.  46
    An Axiomatic System and a Tableau Calculus for STIT Imagination Logic.Grigory K. Olkhovikov & Heinrich Wansing - 2018 - Journal of Philosophical Logic 47 (2):259-279.
    We formulate a Hilbert-style axiomatic system and a tableau calculus for the STIT-based logic of imagination recently proposed in Wansing. Completeness of the axiom system is shown by the method of canonical models; completeness of the tableau system is also shown by using standard methods.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  2.  40
    Inference as Doxastic Agency. Part I: The Basics of Justification Stit Logic.Grigory K. Olkhovikov & Heinrich Wansing - 2019 - Studia Logica 107 (1):167-194.
    In this paper we consider logical inference as an activity that results in proofs and hence produces knowledge. We suggest to merge the semantical analysis of deliberatively seeing-to-it-that from stit theory and the semantics of the epistemic logic with justification from. The general idea is to understand proving that A as seeing to it that a proof of A is available. We introduce a semantics of various notions of proving as an activity and present a number of valid principles that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  3.  34
    On flattening elimination rules.Grigory K. Olkhovikov & Peter Schroeder-Heister - 2014 - Review of Symbolic Logic 7 (1):60-72.
  4.  25
    Model-theoretic characterization of intuitionistic propositional formulas.Grigory K. Olkhovikov - 2013 - Review of Symbolic Logic 6 (2):348-365.
    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 equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to asimulations. Finally, it is proved that a first-order formula is equivalent to a (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  5.  18
    Simplified Tableaux for STIT Imagination Logic.Grigory K. Olkhovikov & Heinrich Wansing - 2019 - Journal of Philosophical Logic 48 (6):981-1001.
    We show how to correct the analytic tableaux system from the paper Olkhovikov and Wansing, 259–279, 2018).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  14
    Inference as doxastic agency. Part II: Ramifications and refinements.Heinrich Wansing & Grigory K. Olkhovikov - 2017 - Australasian Journal of Logic 14 (4):408-438.
    Justification stit logic is a logic for reasoning about proving as a certain kind of activity, namely seeing to it that a proof is publicly available. It merges the semantical analysis of deliberatively seeing-to-it-that from stit theory and the semantics of the epistemic logic with justification from. In this paper, after recalling its language and basic semantical definitions, various ramifications and refinements of justification stit logic are presented and discussed: imposing natural restrictions upon the class of models under consideration, making (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  6
    Craig Interpolation Theorem Fails in Bi-Intuitionistic Predicate Logic.Grigory K. Olkhovikov & Guillermo Badia - forthcoming - Review of Symbolic Logic:1-23.
    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 Urquhart for intuitionistic predicate logic with constant domains [13]. More precisely, we show that there is a valid implication $\phi \rightarrow \psi $ with no interpolant. Importantly, this result does not contradict the unfortunately named ‘Craig interpolation’ theorem established by Rauszer in [24] since that article is about the property more correctly named ‘deductive interpolation’ (see (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  24
    On expressive power of basic modal intuitionistic logic as a fragment of classical FOL.Grigory K. Olkhovikov - 2017 - Journal of Applied Logic 21:57-90.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  9.  12
    On generalized Van Benthem-type characterizations.Grigory K. Olkhovikov - 2017 - Annals of Pure and Applied Logic 168 (9):1643-1691.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  12
    Failure of interpolation in constant domain intuitionistic logic.Grigori Mints, Grigory Olkhovikov & Alasdair Urquhart - 2013 - Journal of Symbolic Logic 78 (3):937-950.
  11.  17
    A Lindström theorem for intuitionistic first-order logic.Grigory Olkhovikov, Guillermo Badia & Reihane Zoghifard - 2023 - Annals of Pure and Applied Logic 174 (10):103346.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  19
    Watergate as democratic ritual.Jeffrey Alexander, Grigory Olkhovikov & Dmitry Kurakin - 2012 - Russian Sociological Review 11 (3):77-104.
    The paper promotes a cultural sociological analysis of one of the most significant and hard-to-explain events in American history when the initial act of breaking and entering into the Democratic Party headquarters at the Watergate Hotel first didn't attract any substantial attention of contemporaries but later initiated a widespread political crisis. J. Alexander considers the dynamics, mechanisms and consequences of the event and its public resonance, building an explanatory model based on his cultural sociological theory. This model allows to reconstruct (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  36
    A Lindström Theorem in Many-Valued Modal Logic over a Finite MTL-chain.Guillermo Badia & Grigory Olkhovikov - forthcoming - Fuzzy Sets and Systems.
    We consider a modal language over crisp frames and formulas evaluated on a finite MTL-chain (a linearly ordered commutative integral residuated lattice). We first show that the basic modal abstract logic with constants for the values of the MTL-chain is the maximal abstract logic satisfying Compactness, the Tarski Union Property and strong invariance for bisimulations. Finally, we improve this result by replacing the Tarski Union Property by a relativization property.
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  12
    Justification announcements in discrete time. Part I: Completeness results.Grigory K. Olkhovikov - 2018 - Logic Journal of the IGPL 26 (3):259-289.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15.  3
    Justification announcements in discrete time. Part II: Frame definability results.Grigory K. Olkhovikov - 2019 - Logic Journal of the IGPL 27 (5):671-692.
    In Part I of this paper we presented a Hilbert-style system $\Sigma _D$ axiomatizing stit logic of justification announcements interpreted over models with discrete time structure. In this part, we prove three frame definability results for $\Sigma _D$ using three different definitions of a frame plus another version of completeness result.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  5
    Restricted interpolation and lack thereof in stit logic.Grigory K. Olkhovikov - 2020 - Review of Symbolic Logic 13 (3):459-482.
    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 whether such a logic enjoys restricted interpolation property, which requires the existence of an interpolant only in cases where the consequence contains no Chellas stit operators occurring in the premise. We show that if action operators count as logical symbols, then such a logic has restricted interpolation property iff the number of agents does (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark