The First Order Theories of the Medvedev and Muchnik Lattices

13 years 8 months ago

Download www.aemlewis.co.uk

We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.

Andrew Lewis, André Nies, Andrea Sorbi

Real-time Traffic

Applied Computing | CIE 2009 | Medevdev Lattice | Muchnik Lattice | Order Theories |

claim paper

» Effectively inseparable Boolean algebras in lattices of sentences

» Developing Morphological Building Blocks From Design to Implementation

» An FDPAlgorithm for Drawing Lattices

» Representing Numeric Values in Concept Lattices

» Randomly shifted lattice rules for unbounded integrands

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2009
Where	CIE
Authors	Andrew Lewis, André Nies, Andrea Sorbi

Comments (0)

Sciweavers

The First Order Theories of the Medvedev and Muchnik Lattices

Applied Computing | CIE 2009 | Medevdev Lattice | Muchnik Lattice | Order Theories |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers