Page 1

Displaying 1 – 4 of 4

Showing per page

Finite models and finitely many variables

Anuj Dawar (1999)

Banach Center Publications

This paper is a survey of results on finite variable logics in finite model theory. It focusses on the common underlying techniques that unite many such results.

Fixpoint alternation: arithmetic, transition systems, and the binary tree

J. C. Bradfield (2010)

RAIRO - Theoretical Informatics and Applications

We provide an elementary proof of the fixpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mu-calculus alternation hierarchy. We further show that the alternation hierarchy on the binary tree is strict, resolving a problem of Niwiński.

Currently displaying 1 – 4 of 4

Page 1