The logic HFL includes negation as a first-class construct and uses a simple type system to identify the monotonic functions on which the application of fixed point operators is semantically meaningful. The model checking problem for HFL over finite transition systems remains decidable, but its expressiveness is rich.
We present a higher order modal fixed point logic (HFL) that extends the modal μ-calculus to allow predicates on states (sets of states) to be specified ...
Oct 22, 2024 · We present a higher order modal fixed point logic (HFL) that extends the modal µ-calculus to allow predicates on states (sets of states) to ...
We present a higher order modal fixed point logic (HFL) that extends the modal μ-calculus to allow predicates on states (sets of states) to be specified ...
We present a higher order modal fixed point logic (HFL) that extends the modal mu-calculus to allow predicates on states (sets of states) to be specified using ...
Sep 14, 2016 · We show that the number and parity of priorities available to an APKA form a proper hierarchy of expressive power as in the modal mu-calculus.
Missing: Fixed Point
HFL is known to be strictly more expressive than the modal µ-calculus but the model-checking problem against finite models is still decidable. In view of the ...
This paper deals with the modal logics associated with (possi- bly nonstandard) provability predicates of Peano Arithmetic. One of our.
Missing: Higher | Show results with:Higher
Jan 13, 2021 · Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic ...
It is defined as the extension of basic propositional modal logic by rules to form the least and the greatest fixed point of definable monotone operators. Lµ is ...