In [3] the existence of the Cantor normal form of ordinals was proven in the Mizar system [6]. In this article its uniqueness is proven and then used to formalize the natural sum of ordinals
In the first part of this work we present some complements on ordinals or some usual applications of...
Summary. We present the choice function rule in the beginning of the article. In the main part of th...
We study a countably infinite iteration of the natural product between ordinals.We present an “effec...
In [3] the existence of the Cantor normal form of ordinals was proven in the Mizar system [6]. In th...
The generalization of the concept of natural integers by means of sum, subtraction, product and quot...
The generalization of the concept of natural integers by means of sum, subtraction, product and quot...
A Coq library on ordinal notations. User contributions to the Coq proof assistan
A Coq library on ordinal notations. User contributions to the Coq proof assistan
This thesis presents a syntactic development of the arithmetic of ordinal numbers less than This is ...
This thesis presents a syntactic development of the arithmetic of ordinal numbers less than This is ...
A Coq library on ordinal notations. User contributions to the Coq proof assistan
A Coq library on ordinal notations. User contributions to the Coq proof assistan
An open problem posed by John H. Conway in [2] was whether one could, on his system of numbers and g...
L.D. Beklemishev has recently introduced a constructive ordinal notation system for the ordinal E > ...
We consider five ordinal notation systems of ε0 which are all well-known and of interest in proof-th...
In the first part of this work we present some complements on ordinals or some usual applications of...
Summary. We present the choice function rule in the beginning of the article. In the main part of th...
We study a countably infinite iteration of the natural product between ordinals.We present an “effec...
In [3] the existence of the Cantor normal form of ordinals was proven in the Mizar system [6]. In th...
The generalization of the concept of natural integers by means of sum, subtraction, product and quot...
The generalization of the concept of natural integers by means of sum, subtraction, product and quot...
A Coq library on ordinal notations. User contributions to the Coq proof assistan
A Coq library on ordinal notations. User contributions to the Coq proof assistan
This thesis presents a syntactic development of the arithmetic of ordinal numbers less than This is ...
This thesis presents a syntactic development of the arithmetic of ordinal numbers less than This is ...
A Coq library on ordinal notations. User contributions to the Coq proof assistan
A Coq library on ordinal notations. User contributions to the Coq proof assistan
An open problem posed by John H. Conway in [2] was whether one could, on his system of numbers and g...
L.D. Beklemishev has recently introduced a constructive ordinal notation system for the ordinal E > ...
We consider five ordinal notation systems of ε0 which are all well-known and of interest in proof-th...
In the first part of this work we present some complements on ordinals or some usual applications of...
Summary. We present the choice function rule in the beginning of the article. In the main part of th...
We study a countably infinite iteration of the natural product between ordinals.We present an “effec...
DOI
Add to ORKG