The following pages link to (Q3408862):
Displaying 50 items.
- Logic of negation-complete interactive proofs (formal theory of epistemic deciders) (Q276034) (← links)
- Expressive power of ``now'' and ``then'' operators (Q302173) (← links)
- Tableau reductions: towards an optimal decision procedure for the modal necessity (Q313007) (← links)
- Covering-based rough sets and modal logics. I. (Q313134) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) (Q352965) (← links)
- Labeled sequent calculi for modal logics and implicit contractions (Q377468) (← links)
- Algebraic properties of stochastic effectivity functions (Q406467) (← links)
- Combined model checking for temporal, probabilistic, and real-time logics (Q407511) (← links)
- Completeness results for memory logics (Q408552) (← links)
- Prefixed tableaus and nested sequents (Q409323) (← links)
- Foundations of instance level updates in expressive description logics (Q420809) (← links)
- Decidability of an Xstit logic (Q456970) (← links)
- Second-order propositional modal logic and monadic alternation hierarchies (Q466445) (← links)
- Products of modal logics and tensor products of modal algebras (Q472808) (← links)
- Bounded semantics (Q483292) (← links)
- Completeness in hybrid type theory (Q484101) (← links)
- Modes of adjointness (Q484110) (← links)
- Duality for the logic of quantum actions (Q495836) (← links)
- Spatial logic of tangled closure operators and modal mu-calculus (Q515566) (← links)
- A stochastic interpretation of game logic (Q516033) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- Practical extraction of evidence terms from common-knowledge reasoning (Q530856) (← links)
- McCarthy variations in a modal key (Q543607) (← links)
- Preface to the special issue: Temporal logics of agency (Q616042) (← links)
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) (Q631075) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- Justification logics and hybrid logics (Q631081) (← links)
- Axiomatizing hybrid products. How can we reason many-dimensionally in hybrid logic? (Q631091) (← links)
- Best unifiers in transitive modal logics (Q647403) (← links)
- Where logic and agents meet (Q657584) (← links)
- Intuitionistic hybrid logic: introduction and survey (Q764256) (← links)
- Quantified temporal alethic boulesic doxastic logic (Q828771) (← links)
- Causality-based game solving (Q832242) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Quantified epistemic logics for reasoning about knowledge in multi-agent systems (Q835839) (← links)
- Symmetric blocking (Q897931) (← links)
- An NP-complete fragment of fibring logic (Q905999) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- Using hybrid logic for coping with functions in subset spaces (Q965902) (← links)
- A dynamic-epistemic hybrid logic for intentions and information changes in strategic games (Q970089) (← links)
- A modal view of the semantics of theoretical sentences (Q987478) (← links)
- Coalgebraic logic for stochastic right coalgebras (Q1023291) (← links)
- A note on a description logic of concept and role typicality for defeasible reasoning over ontologies (Q1632047) (← links)
- Covering-based rough sets and modal logics. II. (Q1642771) (← links)
- Embeddability into relational lattices is undecidable (Q1647970) (← links)
- Compositional meaning in logic (Q1682292) (← links)
- Reverse public announcement operators on expanded models (Q1711510) (← links)
- Reasoning about knowledge, belief and certainty in hierarchical multi-agent systems (Q1712550) (← links)
