Add to ORKGThis discusses a mistake (concerning what a definition is) in “Grelling’s revenge”, Analysis 64, 251-6 (2004), by Dale Jacquette, who claims that the simple theory of types is inconsistent
There is a widespread assumption in type theory that the discipline begins with Russell's efforts to...
Refinement types sharpen systems of simple and dependent types by offering expressive means to more ...
Storrs McCall continues the tradition of Lucas and Penrose in an attempt to refute mechanism by appe...
Gödel claimed that Zermelo-Fraenkel set theory is ‘what becomes of the theory of types if certain su...
It is well-known, due to the work of Girard and Coquand, that adding polymorphic domains to higher o...
Abstract. It is well-known, due to the work of Girard and Coquand, that adding polymorphic domains t...
An axiomatisation of Hurkens’s paradox in dependent type theory is given without assuming any impred...
Data Types, though, as Reynolds stresses, is not perfectly suited for higher type or higher order sy...
Higher-order logic, with its type-theoretic apparatus known as the simple theory of types (STT), has...
We present a type theory with some proof-irrelevance built into theconversion rule. We argue that th...
This on-line version contains a proof of the extended omitting types theorem which is omitted (Ha!) ...
The thesis examines A.N. Whitehead and B. Russell’s Ramified Theory of Types (RTT). It consists of t...
In a series of papers Ladyman and Presnell raise an interesting challenge of providing a pre-mathema...
In a series of papers Ladyman and Presnell raise an interesting challenge of providing a pre-mathema...
A paradox about sets of properties is presented. The paradox, which invokes an impredicatively defin...
There is a widespread assumption in type theory that the discipline begins with Russell's efforts to...
Refinement types sharpen systems of simple and dependent types by offering expressive means to more ...
Storrs McCall continues the tradition of Lucas and Penrose in an attempt to refute mechanism by appe...
Gödel claimed that Zermelo-Fraenkel set theory is ‘what becomes of the theory of types if certain su...
It is well-known, due to the work of Girard and Coquand, that adding polymorphic domains to higher o...
Abstract. It is well-known, due to the work of Girard and Coquand, that adding polymorphic domains t...
An axiomatisation of Hurkens’s paradox in dependent type theory is given without assuming any impred...
Data Types, though, as Reynolds stresses, is not perfectly suited for higher type or higher order sy...
Higher-order logic, with its type-theoretic apparatus known as the simple theory of types (STT), has...
We present a type theory with some proof-irrelevance built into theconversion rule. We argue that th...
This on-line version contains a proof of the extended omitting types theorem which is omitted (Ha!) ...
The thesis examines A.N. Whitehead and B. Russell’s Ramified Theory of Types (RTT). It consists of t...
In a series of papers Ladyman and Presnell raise an interesting challenge of providing a pre-mathema...
In a series of papers Ladyman and Presnell raise an interesting challenge of providing a pre-mathema...
A paradox about sets of properties is presented. The paradox, which invokes an impredicatively defin...
There is a widespread assumption in type theory that the discipline begins with Russell's efforts to...
Refinement types sharpen systems of simple and dependent types by offering expressive means to more ...
Storrs McCall continues the tradition of Lucas and Penrose in an attempt to refute mechanism by appe...