Publication date
January 1976
DOI Publisher
Springer Science and Business Media LLC ISSN
0039-3215Abstract
Using the language of diagonalizable algebras, it is proved that every formula in provability logic admits a unique fixed-point
Using the language of diagonalizable algebras, it is proved that every formula in provability logic admits a unique fixed-point
AbstractBased on an analysis of the inference rules used, we provide a characterization of the situa...
AbstractA unified single proof is given which implies theorems in such diverse fields as continuous ...
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known po...
It is well known that, in Peano arithmetic, there exists a formula Theor (x) which numerates the set...
The basic theorems of Provability Logic arethree in number. First is the Arithmetical Completeness ...
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomi...
International audienceIt is a consequence of existing literature that least and greatest fixed-point...
It follows from known results in the literature that least and greatest fixed-points of monotone pol...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
Say you want to prove something about an infinite data-structure, such as a stream or an infinite tr...
Say you want to prove something about an infinite data-structure, such as a stream or an infinite tr...
Abstract The first order theory of the Diagonalizable Algebra of Peano Arith-metic (DA(PA)) represen...
The aim of this diploma thesis is to discuss the explicit calculations of xed-points in provability ...
It is well-known that, in Peano arithmetic, there exists a formulaTheor(x) which numerates the set o...
We use µMALL, the logic that results from adding least and greatest fixed points to first-order mult...
AbstractBased on an analysis of the inference rules used, we provide a characterization of the situa...
AbstractA unified single proof is given which implies theorems in such diverse fields as continuous ...
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known po...
It is well known that, in Peano arithmetic, there exists a formula Theor (x) which numerates the set...
The basic theorems of Provability Logic arethree in number. First is the Arithmetical Completeness ...
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomi...
International audienceIt is a consequence of existing literature that least and greatest fixed-point...
It follows from known results in the literature that least and greatest fixed-points of monotone pol...
International audienceWe look at characterizing which formulas are expressible in rich decidable log...
Say you want to prove something about an infinite data-structure, such as a stream or an infinite tr...
Say you want to prove something about an infinite data-structure, such as a stream or an infinite tr...
Abstract The first order theory of the Diagonalizable Algebra of Peano Arith-metic (DA(PA)) represen...
The aim of this diploma thesis is to discuss the explicit calculations of xed-points in provability ...
It is well-known that, in Peano arithmetic, there exists a formulaTheor(x) which numerates the set o...
We use µMALL, the logic that results from adding least and greatest fixed points to first-order mult...
AbstractBased on an analysis of the inference rules used, we provide a characterization of the situa...
AbstractA unified single proof is given which implies theorems in such diverse fields as continuous ...
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known po...
Add to ORKG