IWIgor Walukiewicz
Igor Walukiewicz
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
Latest Publications
- 1 January 2005
- Published by Springer Nature in Formal Methods in System Design
- Vol. 26 (1) , 27-43
Difficult Configurations?On the Complexity of LTrL
- 1 January 2005
- Published by Springer Nature in Formal Methods in System Design
- Vol. 26 (1) , 27-43
Difficult Configurations?On the Complexity of LTrL
- 1 January 2001
- Published by Elsevier in Information and Computation
- Vol. 164 (2) , 234-263
Pushdown Processes: Games and Model-Checking
- 1 January 2001
- Published by Elsevier in Information and Computation
- Vol. 164 (2) , 234-263
Pushdown Processes: Games and Model-Checking
- 1 January 1998
- Published by Springer Nature
- p. 140-151
Difficult configurations — on the complexity of LTrL
- 1 January 1998
- Published by Springer Nature
- p. 140-151
Difficult configurations — on the complexity of LTrL
- 1 September 1996
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 2 (3) , 349-366
A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
The prepositional μ-calculus is an extension of the modal system K with a least fixpoint operator. Kozen posed a question about completeness of the axiomatisation of the logic which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.
- 1 September 1996
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 2 (3) , 349-366
A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
The prepositional μ-calculus is an extension of the modal system K with a least fixpoint operator. Kozen posed a question about completeness of the axiomatisation of the logic which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.