Alexander V. Chagrov

According to our database, Alexander V. Chagrov authored at least 9 papers between 1991 and 2006.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2006

The Truth About Algorithmic Problems in Correspondence Theory.

Alexander V. Chagrov, Lilia Chagrova

Proceedings of the Advances in Modal Logic 6, 2006

2002

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

Alexander V. Chagrov, Mikhail N. Rybakov

Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002

1997

Modal Logic.

Alexander V. Chagrov, Michael Zakharyaschev

Oxford logic guides 35, Oxford University Press, ISBN: 978-0-19-853779-3, 1997

1995

Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.

Alexander V. Chagrov, L. A. Chagrova

Stud Logica, 1995

On the Independent Axiomatizability of Modal and Intermediate Logics.

Alexander V. Chagrov, Michael Zakharyaschev

J. Log. Comput., 1995

1994

Algorithmic Aspects of Propositional Tense Logics.

Alexander V. Chagrov, Valentin B. Shehtman

Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1993

The Undecidability of the Disjunction Property of Propositional Logics and Other Related Problems.

Alexander V. Chagrov, Michael Zakharyaschev

J. Symb. Log., 1993

1992

Modal Companions of Intermediate Propositional Logics.

Alexander V. Chagrov, Michael Zakharyaschev

Stud Logica, 1992

1991

The disjunction property of intermediate propositional logics.

Alexander V. Chagrov, Michael Zakharyaschev

Stud Logica, 1991