Peter Aczel has given a categorical construction for fixed points of normal functors, that is, dilators which preserve initial segments. For a general dilator X↦TX, we cannot expect to obtain a well‐founded fixed point, as the order type of TX may always exceed the order type of X. In the present paper, we show how to construct a Bachmann–Howard fixed point of T, that is, an order BH(T) with an ‘almost’ order preserving collapse ϑ:TBH(T)→BH(T). Building on previous work, we show that Π11‐comprehension is equivalent to the assertion that BH(T) is well‐founded for any dilator T
The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
Abstract Say you want to prove something about an infinite data-structure, such as a stream or an in...
This thesis introduces a well-ordering principle of type two, which we call the Bachmann-Howard prin...
This thesis introduces a well-ordering principle of type two, which we call the Bachmann-Howard prin...
AbstractIn this paper we show how dilators (in the sense of J.-Y. Girard) may be regarded as certain...
AbstractThe λY calculus is the simply typed λ calculus augmented with the fixed point operators. We ...
This paper provides a canonical construction of a Noetherian least fixed point topology. While such ...
The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
Consider a normal function f on the ordinals (i. e. a function f that is strictly increasing and con...
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms o...
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in te...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
In recent years several extensions of first-order logic have been investigated in the context of fin...
The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
Abstract Say you want to prove something about an infinite data-structure, such as a stream or an in...
This thesis introduces a well-ordering principle of type two, which we call the Bachmann-Howard prin...
This thesis introduces a well-ordering principle of type two, which we call the Bachmann-Howard prin...
AbstractIn this paper we show how dilators (in the sense of J.-Y. Girard) may be regarded as certain...
AbstractThe λY calculus is the simply typed λ calculus augmented with the fixed point operators. We ...
This paper provides a canonical construction of a Noetherian least fixed point topology. While such ...
The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
Consider a normal function f on the ordinals (i. e. a function f that is strictly increasing and con...
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms o...
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in te...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
In recent years several extensions of first-order logic have been investigated in the context of fin...
The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
Abstract Say you want to prove something about an infinite data-structure, such as a stream or an in...