scientific article; zbMATH DE number 1302492
The author investigates the expressive power of the least fixed-point logic and the transitive closure logic. Using a downward Löwenheim-Skolem theorem he shows that the least fixed-point logic can be interpreted in the monadic second-order logic and that these logics are of the same expressive power for countable well-orderings. On the other hand it is shown that these two logics differ for the class of scattered orderings. I'he author investigates the expressive power of transitive closure logic for unbounded \(\omega\)-trees. This is used to investigate the expression of height of elements in reduced abelian groups in this logic. For the entire collection see [Zbl 0905.00049].
- Guarded fixed point logics and the monadic theory of countable trees.
- On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
- An Infinitary Model of Linear Logic
- scientific article; zbMATH DE number 1163986 (Why is no real title available?)
- Fixed Point Logics
- On equivalence of infinitary formulas under the stable model semantics
- scientific article; zbMATH DE number 2182490 (Why is no real title available?)
- scientific article; zbMATH DE number 203220 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2005
- Tameness in least fixed-point logic and McColm's conjecture
- Iterated elementary embeddings and the model theory of infinitary logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247808)