Commutative Partially Ordered Recursive Arithmetics.
Completeness of a cut-free calculus with equality and function constants.
Completeness of cut-free type theories.
Completeness properties of classical theories of finite type and the normal form theorem [Book]
Completion closed algebras and models of Peano arithmetic
Computable structures and operations on the space of continuous functions
We use ideas and machinery of effective algebra to investigate computable structures on the space C[0,1] of continuous functions on the unit interval. We show that (C[0,1],sup) has infinitely many computable structures non-equivalent up to a computable isometry. We also investigate if the usual operations on C[0,1] are necessarily computable in every computable structure on C[0,1]. Among other results, we show that there is a computable structure on C[0,1] which computes + and the scalar multiplication,...
Connectedness of the theory of non-surjective injections
Connections between cuts and maximum segments
Consistency proof without transfinite induction for a formal system for turing machines.
Constructing Kripke models of certain fragments of Heyting's arithmetic.
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).
Constructions of finitely generated submodules of constructively noetherian modules
Constructive analysis and thermodynamics formulations.
Constructive Coordinatization of Desarguesian Planes.
Constructive dimension theory
Constructive irrational space.
Correció a l'article: "Analisi formalment recursiva".
Corrección del artículo del autor "Anàlisi formalment recursiva", publicado en Publicacions de la Secció de Matemàtiques de la UAB, 30 (2-3), p. 35-75 (1986).
Counting sets
Cut elimination for impredicative infinitary systems. Part II Ordinal analysis for iterated inductive definitions.
Cut-elimination for impredicative infinitary systems. Part I. Ordinal-analysis for ID1.