Page 1 Next

Displaying 1 – 20 of 29

Showing per page

Computable structures and operations on the space of continuous functions

Alexander G. Melnikov, Keng Meng Ng (2016)

Fundamenta Mathematicae

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,...

Construction of sentences with specific interpretability properties

A. Stern (1993)

Fundamenta Mathematicae

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).

Currently displaying 1 – 20 of 29

Page 1 Next