Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics."

Alexander V. Chagrov, Mikhail N. Rybakov (2002)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2024-01-17

- view
  - electronic edition @ aiml.net (open access)
- export record
  dblp key:
  - conf/aiml/ChagrovR02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiml/ChagrovR02
Alexander V. Chagrov, Mikhail N. Rybakov:
How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics. Advances in Modal Logic 2002: 71-82

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.