Switch to: References

Add citations

You must login to add citations.
  1. Definability in the class of all -frames – computability and complexity.D. T. Georgiev - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):1-26.
    In the basic modal language and in the basic modal language with the added universal modality, first-order definability of all formulas over the class of all frames is shown. Also, it is shown that the problems of modal definability of first-order sentences over the class of all frames in the languages and are both PSPACE-complete.
    Download  
     
    Export citation  
     
    Bookmark