A general method for proving decidability of intuitionistic modal logics (Q2506825): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MiniML / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jal.2005.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077679640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal languages and bounded fragments of predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational types from a logical perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an intuitionistic modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal extension of intuitionist logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPC as the formalisation of an intuitionist concept of modality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal analysis of staged computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for stronger normal intuitionistic modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional lax logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modality and possibility in some intuitionistic modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monad as modality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of computation and monads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3472079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A judgmental reconstruction of modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logics for communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive modal logics. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789450 / rank
 
Normal rank

Latest revision as of 21:31, 24 June 2024

scientific article
Language Label Description Also known as
English
A general method for proving decidability of intuitionistic modal logics
scientific article

    Statements

    A general method for proving decidability of intuitionistic modal logics (English)
    0 references
    0 references
    0 references
    10 October 2006
    0 references
    0 references
    intuitionistic modal logics
    0 references
    decidability
    0 references
    0 references