scispace - formally typeset
Journal ArticleDOI

Untersuchungen über das logische Schließen. II

Gerhard Gentzen
- 01 Dec 1935 - 
- Vol. 39, Iss: 1, pp 176-210
TLDR
In this paper, a process for sizing cellulose fibers or cellulose fiber containing materials and a composition for carrying out the process are described, and a method for sizing according to the general formula of R1 is presented.
Abstract
The present invention relates to a process for sizing cellulose fibers or cellulose fiber containing materials and to a composition for carrying out the process. More particularly the invention relates to a process for sizing according to which cellulose fibers or cellulose fiber containing materials in a manner known per se are brought into contact with compounds having the general formula WHEREIN R1 is an organic, hydrophobic group having 8 to 40 carbon atoms and R2 is an alkyl group having 1 to 7 carbon atoms or has the same meaning as R1.

read more

Citations
More filters
Journal ArticleDOI

The Mathematics of Sentence Structure

TL;DR: An effective rule (or algorithm) for distinguishing sentences from nonsentences is obtained, which works not only for the formal languages of interest to the mathematical logician, but also for natural languages such as English, or at least for fragments of such languages.
Book ChapterDOI

An Intuitionistic Theory of Types: Predicative Part

TL;DR: The theory of types as mentioned in this paper is a full-scale system for formalizing intuitionistic mathematics as developed, which allows proofs to appear as parts of propositions so that the propositions of the theory can express properties of proofs.
Dissertation

Towards a practical programming language based on dependent type theory

Ulf Norell
TL;DR: This thesis is concerned with bridging the gap between the theoretical presentations of type theory and the requirements on a practical programming language.
Book ChapterDOI

Constructive mathematics and computer programming

TL;DR: This chapter discusses that relating constructive mathematics to computer programming seems to be beneficial, and that it may well be possible to turn what is now regarded as a high level programming language into machine code by the invention of new hardware.
Journal ArticleDOI

Three Uses of the Herbrand-Gentzen Theorem in Relating Model Theory and Proof Theory

TL;DR: The Herbrand-Gentzen Theorem will be applied to generalize Beth's results from primitive predicate symbols to arbitrary formulas and terms, showing that the expressive power of each first-order system is rounded out, or the system is functionally complete.