36 found
Order:
  1.  16
    Modal Logic with Names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
    We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   27 citations  
  2.  4
    Elementary Canonical Formulae: Extending Sahlqvist's Theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
    We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  3.  17
    Hierarchies of Modal and Temporal Logics with Reference Pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
    We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's and (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  4.  46
    Comparing Semantics of Logics for Multi-Agent Systems.Valentin Goranko & Wojciech Jamroga - 2004 - Synthese 139 (2):241 - 280.
    We draw parallels between several closely related logics that combine — in different proportions — elements of game theory, computation tree logics, and epistemic logics to reason about agents and their abilities. These are: the coalition game logics CL and ECL introduced by Pauly 2000, the alternating-time temporal logic ATL developed by Alur, Henzinger and Kupferman between 1997 and 2002, and the alternating-time temporal epistemic logic ATEL by van der Hoek and Wooldridge (2002). In particular, we establish some subsumption and (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  5.  6
    Modal Logics for Parallelism, Orthogonality, and Affine Geometries.Philippe Balbiani & Valentin Goranko - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):365-397.
  6.  20
    The Craig Interpolation Theorem for Prepositional Logics with Strong Negation.Valentin Goranko - 1985 - Studia Logica 44 (3):291 - 317.
    This paper deals with, prepositional calculi with strong negation (N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  7.  14
    A Road Map of Interval Temporal Logics and Duration Calculi.Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):9-54.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  8.  24
    Axiomatizations with Context Rules of Inference in Modal Logic.Valentin Goranko - 1998 - Studia Logica 61 (2):179-197.
    A certain type of inference rules in modal logics, generalizing Gabbay's Irreflexivity rule, is introduced and some general completeness results about modal logics axiomatized with such rules are proved.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  9.  3
    From Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability.Valentin Goranko & Alberto Zanardo - 2006 - Logic Journal of the IGPL 15 (1):53-76.
    This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combinations, in various degrees, of languages and semantics for linear time with a modality for possible paths. We then consider (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  10.  3
    IV. Semantic Extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):175-211.
  11.  6
    Dov Gabbay, Reactive Kripke Semantics.Valentin Goranko - 2017 - Studia Logica 105 (2):431-437.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12.  1
    Classes and Theories of Trees Associated with a Class of Linear Orders.Valentin Goranko & Ruaan Kellerman - 2011 - Logic Journal of the IGPL 19 (1):217-232.
    Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of (...)
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  13.  7
    Modal Definability in Enriched Languages.Valentin Goranko - 1989 - Notre Dame Journal of Formal Logic 31 (1):81-105.
  14.  15
    The Basic Algebra of Game Equivalences.Valentin Goranko - 2003 - Studia Logica 75 (2):221 - 238.
    We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  15.  21
    Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
  16.  12
    Hyperboolean Algebras and Hyperboolean Modal Logic.Valentin Goranko & Dimiter Vakarelov - 1999 - Journal of Applied Non-Classical Logics 9 (2):345-368.
  17. Algorithmic Correspondence and Completeness in Modal Logic. V. Recursive Extensions of SQEMA.Willem Conradie, Valentin Goranko & Dimitar Vakarelov - 2010 - Journal of Applied Logic 8 (4):319-333.
  18.  26
    Refutation Systems in Modal Logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
    Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  19.  14
    The Modal Logic of the Countable Random Frame.Valentin Goranko & Bruce Kapron - 2003 - Archive for Mathematical Logic 42 (3):221-243.
    We study the modal logic M L r of the countable random frame, which is contained in and `approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of M L r and show that it is not finitely axiomatizable. Then we describe the finite frames of that logic and show that it has the (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  20.  32
    Tableaux-Based Decision Method for Single-Agent Linear Time Synchronous Temporal Epistemic Logics with Interacting Time and Knowledge.Mai Ajspur & Valentin Goranko - 2013 - In Kamal Lodaya (ed.), Logic and its Applications. Springer. pp. 80--96.
    Direct download  
     
    Export citation  
     
    My bibliography  
  21. Strategic Commitment and Release in Logics for Multi-Agent Systems.Thomas Ågotnes, Valentin Goranko & Wojciech Jamroga - 2008 - In Giacomo Bonanno, Wiebe van der Hoek & Michael Wooldridge (eds.), Logic and the Foundations of Game and Decision Theory. Amsterdam University Press. pp. 6006.
     
    Export citation  
     
    My bibliography  
  22.  5
    Proving Unprovability in Some Normal Modal Logics.Valentin Goranko - 1991 - Bulletin of the Section of Logic 20 (1):23-29.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  23.  45
    An Extended Branching-Time Ockhamist Temporal Logic.Mark Brown & Valentin Goranko - 1999 - Journal of Logic, Language and Information 8 (2):143-166.
    For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated restricted variables called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modality, localized to the set of all possible futures at the actual moment of time.We construct an axiomatic system for this (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  24.  15
    Model-Checking CTL* Over Flat Presburger Counter Systems.Stéphane Demri, Alain Finkel, Valentin Goranko & Govert van Drimmelen - 2010 - Journal of Applied Non-Classical Logics 20 (4):313-344.
  25.  22
    Logic for Physical Space.Marco Aiello, Guram Bezhanishvili, Isabelle Bloch & Valentin Goranko - 2012 - Synthese 186 (3):619-632.
    Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26.  12
    Logic for Physical Space: From Antiquity to Present Days.Marco Aiello, Guram Bezhanishvili, Isabelle Bloch & Valentin Goranko - 2012 - Synthese 186 (3):619-632.
    Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  27.  26
    Nicholas Rescher, Paradoxes: Their Roots, Range, and Resolution; Patrick Blackburn, Maarten de Rijke and Yde Venema, Modal Logic, Cambridge Tracts in Theoretical Computer Science Vol. 53.Andrea Cantini & Valentin Goranko - 2004 - Studia Logica 76 (1):135-142.
  28.  9
    Propositional Interval Neighborhood Logics: Expressiveness, Decidability, and Undecidable Extensions.Davide Bresolin, Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2009 - Annals of Pure and Applied Logic 161 (3):289-304.
    In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  29.  18
    Logic in Computer Science: Modelling and Reasoning About Systems. [REVIEW]Valentin Goranko - 2006 - Journal of Logic, Language and Information 16 (1):117-120.
  30.  16
    Modal Logic, Alexander Chagrov and Michael Zakharyaschev.Valentin Goranko - 1999 - Journal of Logic, Language and Information 8 (2):255-258.
  31.  13
    Reasoning About Knowledge, Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi.Valentin Goranko - 1999 - Journal of Logic, Language and Information 8 (4):469-473.
  32.  2
    The Basic Algebra of Game Equivalences.Valentin Goranko - 2003 - Studia Logica 75 (2):221-238.
    We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities. En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways game identities into modal formulae. The completeness proof is based on reduction of game terms to a (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  33.  3
    Foreword.Valentin Goranko & Angelo Montanari - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):7-8.
  34.  3
    Foreword.Valentin Goranko & Wojciech Jamroga - 2011 - Journal of Applied Non-Classical Logics 21 (1):7-8.
  35.  1
    Nicholas Rescher,; Patrick Blackburn, Maarten de Rijke and Yde Venema, Cambridge Tracts in Theoretical Computer Science Vol. 53.Andrea Cantini & Valentin Goranko - 2004 - Studia Logica 76 (1):135-142.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  36. Advances in Modal Logic 8.Lev Beklemishev, Valentin Goranko & Valentin B. Shehtman (eds.) - 2010 - College Publications.
     
    Export citation  
     
    My bibliography