Skip to content
<title>Channels - Modal Logics for Nominal Transition Systems :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Modal Logics for Nominal Transition Systems
Search for more channels:
Similar Items: Modal Logics for Nominal Transition Systems
Channel Options
View Record
Explore related channels
Quick Look
Formalising the pi-calculus using nominal logic
Quick Look
Psi-calculi: a framework for mobile processes with nominal data and logic
Quick Look
Modal Logics of Topological Relations
Quick Look
Modal meet-implication logic
Quick Look
On Nested Sequents for Constructive Modal Logics
Quick Look
A Real-Valued Modal Logic
Quick Look
On Sub-Propositional Fragments of Modal Logic
Quick Look
Dual-Context Calculi for Modal Logic
Quick Look
Completeness of Nominal PROPs
Quick Look
Canonical Models and the Complexity of Modal Team Logic
Quick Look
Validity and Entailment in Modal and Propositional Dependence Logics
Quick Look
Generic Modal Cut Elimination Applied to Conditional Logics
Quick Look
Towards a Proof Theory of Gödel Modal Logics
Quick Look
Automata theory in nominal sets
Quick Look
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic
Quick Look
Disjunctive bases: normal forms and model theory for modal logics
Quick Look
Complexity results for modal logic with recursion via translations and tableaux
Quick Look
Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
Quick Look
Full abstraction for nominal general references
Quick Look
A dependent nominal type theory
Quick Look
Rule Formats for Nominal Process Calculi
Quick Look
On Nominal Syntax and Permutation Fixed Points
Quick Look
Residuality and Learning for Nondeterministic Nominal Automata
Quick Look
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
Load more items
View Record
Prev
Explore related channels
Next
