Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-15T05:31:42.162Z Has data issue: false hasContentIssue false

Yet another hierarchy theorem

Published online by Cambridge University Press:  12 March 2014

Max Kubierschky*
Affiliation:
Abteilung für Mathematische Logik, Albert-Ludwigs-Universität, Eckerstr 1, 79104 Freiburg, Germany

Abstract

n + 1 nested k-ary fixed point operators are more expressive than n. This holds on finite structures for all sublogics of partial fixed point logic PFP that can express conjunction, existential quantification and deterministic transitive closure of binary relations using at most k-ary fixed point operators and that are closed against subformulas. Among those are a lot of popular fixed point logics.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable