A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already exis...
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
Leo Harrington showed that the second-order theory of arithmetic WKL0 is 1 1-conservative over the theory RCA0. Harrington's proof is model-theoretic, making use of a forcing...