AbstractSystems TRC and TRCU of illative combinatory logic are introduced and shown to be equivalent in consistency strength and expressive power to Quine's set theory ‘New Foundations’ (NF) and the fragment NFU + Infinity of NF described by Jensen, respectively. Jensen demonstrated the consistency of NFU + Infinity relative to ZFC; the question of the consistency of NF remains open. TRC and TRCU are presented here as classical first-order theories, although they can be presented as equational theories; they are not constructive
This book, now in a thoroughly revised second edition, provides a comprehensive and accessible intro...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
Studies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Inde...
AbstractSystems TRC and TRCU of illative combinatory logic are introduced and shown to be equivalent...
We develop a theory for constructing Combinatory Versions of λ-calculi. Our theory is based on a met...
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extr...
In this paper we settle a conjecture suggested by Quine (1937, 1938, 1951, 1956, 1960, 1963). Our th...
In this paper we settle a conjecture suggested by Quine (1937, 1938, 1951, 1956, 1960, 1963). Our th...
Typical arguments for results like Kleene's Second Recursion Theorem and theexistence of self-writin...
In this paper we settle a conjecture suggested by Quine (1937, 1938, 1951, 1956, 1960, 1963). Our th...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
I consider the question of the consistency of ZF set theory and of its large cardinal extensions, fr...
For each Pure Type System there is a closely related “corresponding ” system of illative combinatory...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
This book, now in a thoroughly revised second edition, provides a comprehensive and accessible intro...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
Studies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Inde...
AbstractSystems TRC and TRCU of illative combinatory logic are introduced and shown to be equivalent...
We develop a theory for constructing Combinatory Versions of λ-calculi. Our theory is based on a met...
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extr...
In this paper we settle a conjecture suggested by Quine (1937, 1938, 1951, 1956, 1960, 1963). Our th...
In this paper we settle a conjecture suggested by Quine (1937, 1938, 1951, 1956, 1960, 1963). Our th...
Typical arguments for results like Kleene's Second Recursion Theorem and theexistence of self-writin...
In this paper we settle a conjecture suggested by Quine (1937, 1938, 1951, 1956, 1960, 1963). Our th...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
I consider the question of the consistency of ZF set theory and of its large cardinal extensions, fr...
For each Pure Type System there is a closely related “corresponding ” system of illative combinatory...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
This book, now in a thoroughly revised second edition, provides a comprehensive and accessible intro...
Quine often argued for a simple, untyped system of logic rather than the typed systems that were cha...
Studies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Inde...