let EA be the formal system of elementary analysis. The following is prowed by Schutte [7] that we have a proof of the consistency of EA by transfinite induction up to ε. ..
For any collection of sets of reals C, let C-DET be the statement that all sets of reals in C are de...
The consistency formula for set theory T e. g. Zermelo-Fraenkel set theory ZF, can be stated in form...
The arithmetical theory EA(I;O) developed by Çagman, Ostrin and Wainer ([18] and [48]) provides a fo...
The formal system in which the Peano’s axioms hold for numbers and there are quantifications over pr...
This paper offers an elementary proof that formal arithmetic is consistent. The system that will be ...
This work presents some demonstrations of the consistency of classical arithmetic, proven by Gödel...
We consider the consistency proof for a weak fragment of arithmetic published by von Neumann in 1927...
In the context of Elementary Arithmetic (EA) we know that already an extremely weak arithmetical the...
The consistency formula for gödelian Arithmetics T can be stated as free-variable predicate in terms...
If nowadays “Gentzen’s consistency proof for arithmetic ” is mentioned, one usually refers to [Ge38]...
We prove consistency of Quine's New Foundations by an ultrafilter completion construction based on a...
AbstractThere is a very simple way in which the safe/normal variable discipline of Bellantoni–Cook r...
In a famous paper of 1931, Gödel proved that any formalization of elementary Arithmetic is incomplet...
Context: Consistency of mathematical constructions in numerical analysis and the application of comp...
It is widely accepted that a theory of truth for arithmetic should be consistent, but ω-consistency ...
For any collection of sets of reals C, let C-DET be the statement that all sets of reals in C are de...
The consistency formula for set theory T e. g. Zermelo-Fraenkel set theory ZF, can be stated in form...
The arithmetical theory EA(I;O) developed by Çagman, Ostrin and Wainer ([18] and [48]) provides a fo...
The formal system in which the Peano’s axioms hold for numbers and there are quantifications over pr...
This paper offers an elementary proof that formal arithmetic is consistent. The system that will be ...
This work presents some demonstrations of the consistency of classical arithmetic, proven by Gödel...
We consider the consistency proof for a weak fragment of arithmetic published by von Neumann in 1927...
In the context of Elementary Arithmetic (EA) we know that already an extremely weak arithmetical the...
The consistency formula for gödelian Arithmetics T can be stated as free-variable predicate in terms...
If nowadays “Gentzen’s consistency proof for arithmetic ” is mentioned, one usually refers to [Ge38]...
We prove consistency of Quine's New Foundations by an ultrafilter completion construction based on a...
AbstractThere is a very simple way in which the safe/normal variable discipline of Bellantoni–Cook r...
In a famous paper of 1931, Gödel proved that any formalization of elementary Arithmetic is incomplet...
Context: Consistency of mathematical constructions in numerical analysis and the application of comp...
It is widely accepted that a theory of truth for arithmetic should be consistent, but ω-consistency ...
For any collection of sets of reals C, let C-DET be the statement that all sets of reals in C are de...
The consistency formula for set theory T e. g. Zermelo-Fraenkel set theory ZF, can be stated in form...
The arithmetical theory EA(I;O) developed by Çagman, Ostrin and Wainer ([18] and [48]) provides a fo...
DOI
Add to ORKG