The following pages link to Valentin F. Goranko (Q703859):
Displaying 50 items.
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
- Logic for physical space. From antiquity to present day (Q382998) (← links)
- Book review of: D. M. Gabbay, Reactive Kripke semantics (Q526740) (← links)
- (Q586518) (redirect page) (← links)
- Dynamic extensions of arrow logic (Q598299) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions (Q636267) (← links)
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. (Q703860) (← links)
- Modal characterisation theorems over special classes of frames (Q732052) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy (Q897593) (← links)
- Modal definability in enriched languages (Q918533) (← links)
- Completions of \(\mu \)-algebras (Q925850) (← links)
- Cut-free sequent systems for temporal logic (Q941433) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- Reasoning about temporal properties of rational play (Q1028639) (← links)
- The Craig interpolation theorem for propositional logics with strong negation (Q1071753) (← links)
- An extended branching-time Ockhamist temporal logic (Q1288173) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q1295436) (← links)
- Modal logic with names (Q1310624) (← links)
- Refutation systems in modal logic (Q1327486) (← links)
- The modal logic of the countable random frame (Q1407589) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- The basic algebra of game equivalences (Q1425189) (← links)
- Axiomatizations with context rules of inference in modal logic (Q1580652) (← links)
- Rational coordination with no communication or conventions (Q1679741) (← links)
- Interactions between knowledge, action and commitment within agent dynamic logic (Q1770620) (← links)
- The equational theory of regular words (Q1776401) (← links)
- Elementary definability and completeness in general and positive modal logic (Q1868490) (← links)
- Hierarchies of modal and temporal logics with reference pointers (Q1919987) (← links)
- Completeness theorems for reactive modal logics (Q1935589) (← links)
- Measuring inconsistency in some logics with tense operators (Q2080703) (← links)
- Knowledge-based strategies for multi-agent teams playing against nature (Q2152496) (← links)
- A logic for conditional local strategic reasoning (Q2155205) (← links)
- Efficient decision procedure for propositional projection temporal logic (Q2197530) (← links)
- Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking (Q2225595) (← links)
- The dark side of interval temporal logic: marking the undecidability border (Q2251125) (← links)
- Towards a logic for conditional local strategic reasoning (Q2291231) (← links)
- Alternating-time temporal logic ATL with finitely bounded semantics (Q2334601) (← links)
- Varieties of rigidity (Q2334657) (← links)
- Complete axiomatization and decidability of alternating-time temporal logic (Q2368988) (← links)
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator (Q2372202) (← links)
- Comparing semantics of logics for multi-agent systems (Q2431875) (← links)
- Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906) (← links)
- A general tableau method for propositional interval temporal logics: theory and implementation (Q2506829) (← links)
- The equational theory of a nontrivial discriminator variety is co-NP-hard (Q2577705) (← links)
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
- Sahlqvist Formulas in Hybrid Polyadic Modal Logics (Q2772884) (← links)
- Two-Player Preplay Negotiation Games with Conditional Offers (Q2802697) (← links)
