A note on proofs of falsehood.
A sentence that is difficult to interpret
Ambiguity and stratification
An interpretation of in -NIA.
Beweistheorie von KPN.
Connectedness of the theory of non-surjective injections
Construction of sentences with specific interpretability properties
The Rowland Institute for Science, 100 Cambridge Parkway, Cambridge, Massachusetts 02142, U.S.A. A construction is presented for generating sentences that satisfy a recursively enumerable set of interpretability properties. This construction is then used to prove three previously announced results concerning the lattice of local interpretability types of theories (also known as the Lattice of Chapters).
Degrees of interpretability
Independent instances for some undecidable problems
Interpretationen der Heyting-Arithmetik endlicher Typen.
Interpreting reflexive theories in finitely many axioms
For finitely axiomatized sequential theories F and reflexive theories R, we give a characterization of the relation ’F interprets R’ in terms of provability of restricted consistency statements on cuts. This characterization is used in a proof that the set of (as well as ) sentences π such that GB interprets ZF+π is -complete.
Modal Translations of Heyting and Peano Arithmetic
O druhém Hilbertově problému (Otázka bezespornosti aritmetiky)
On interpretability in theories containing arithmetic. II.
Partial conservativity revisited
Shiftings of the horizon
Some comments on the paper by Artigue, Isambert, Perrin and Zalc
Some remarks on bicommutability
Spielquantorinterpretationen unstetiger Funktionale der höheren Analysis.
Sul problema dell'autoriferimento
We formulate, within the frame-theory for the foundations of Mathematics outlined in [2], a list of axioms which state that almost all "interesting" collections and almost all "interesting" operations are elements of the universe. The resulting theory would thus have the important foundational feature of being completely self-contained. Unfortunately, the whole list is inconsistent, and we are led to formulate the following problem, which we call the problem of self-reference: "Find out...