Lexicon of Arguments

Complaints - Corrections

Table

Concepts
Versus
Sc. Camps
Theses I
Theses II

Concept/Author*  

What is wrong?

Page
Other metadata
Translation
Excerpt or content
Other

Correction: Year / Place / Page

/ /

Correction:
(max 500 charact.)

Your username*

or User-ID

Email address*

The complaint
will not be published.

 

Berka I 266
"Over-countable"/infinite/LorenzenVsSet theory: fable realm of the "Over-Countable". ((s) is not constructible).
>constructivism, >Set theory.
Berka I 272
Infinite/premisses/dialogical logic/Lorenzen: one can state a step number l
e0 = ω exp ω exp ω exp...

P can thus first calculate an ordinal number I >Derivation, >Derivability.
The calculation process is recursive, so even in the narrowest sense constructive.
>Constructivism, >Recursion, >Recursivity, >Calculability.
The statement forms that are used in the consistency proof are generally not recursive.⁽¹⁾
>Consistency, >Proofs, >Provability.

1. P. Lorenzen, Ein dialogisches Konstruktivitätskriterium, in: Infinitistic Methods, (1961), 193-200

Found an error? Use our Complaint Form. Perhaps someone forgot to close a bracket? A page number is wrong?
Help us to improve our lexicon.
However, if you are of a different opinion, as regards the validity of the argument, post your own argument beside the contested one.
The correction will be sent to the contributor of the original entry to get his opinion about.