Alexander V. Chagrov

2006
7	EE	Alexander V. Chagrov, Lilia Chagrova: The Truth About Algorithmic Problems in Correspondence Theory. Advances in Modal Logic 2006: 121-138
2002
6		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
1995
5		Alexander V. Chagrov, Michael Zakharyaschev: On the Independent Axiomatizability of Modal and Intermediate Logics. J. Log. Comput. 5(3): 287-302 (1995)
4		Alexander V. Chagrov, L. A. Chagrova: Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames. Studia Logica 55(3): 421-448 (1995)
1994
3		Alexander V. Chagrov, Valentin B. Shehtman: Algorithmic Aspects of Propositional Tense Logics. CSL 1994: 442-455
1993
2		Alexander V. Chagrov, Michael Zakharyaschev: The Undecidability of the Disjunction Property of Propositional Logics and Other Related Problems. J. Symb. Log. 58(3): 967-1002 (1993)
1992
1		Alexander V. Chagrov, Michael Zakharyaschev: Modal Companions of Intermediate Propositional Logics. Studia Logica 51(1): 49-82 (1992)

Coauthor Index

1	Lilia Chagrova (L. A. Chagrova)	[4] [7]
2	Mikhail N. Rybakov	[6]
3	Valentin B. Shehtman	[3]
4	Michael Zakharyaschev	[1] [2] [5]

Colors in the list of coauthors