Temporal logic with accessibility temporal relations generated by time states themselves (Q779153): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Unification of concept terms in description logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Temporal Logic LTL: Basis for Admissible Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: One hundred and two problems in mathematical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of modal and temporal logics with reference pointers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification through projectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference rules in Nelson's logics, admissibility and weak admissibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined common knowledge logics or logics of common information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical consecutions in discrete linear temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear temporal logic with until and next, logical consecutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Temporal Logic LTLK extended by Multi-Agent Logic Kn with Interacting Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Writing out Unifiers in Linear Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-transitive linear temporal logic and logical knowledge operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nontransitive temporal multiagent logic, information and knowledge, deciding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent temporal logics with multivaluations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal multi-valued logic with lost worlds in the past / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time agents logics, satisfiability problem by rules in reduced form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tableau Method for Checking Rule Admissibility in S4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tense logic and time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532196 / rank
 
Normal rank

Latest revision as of 04:12, 23 July 2024

scientific article
Language Label Description Also known as
English
Temporal logic with accessibility temporal relations generated by time states themselves
scientific article

    Statements

    Temporal logic with accessibility temporal relations generated by time states themselves (English)
    0 references
    21 July 2020
    0 references
    0 references
    temporal logic
    0 references
    non-classical logics
    0 references
    information
    0 references
    knowledge representation
    0 references
    deciding algorithms
    0 references
    computability
    0 references
    satisfiability
    0 references
    decidability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references