Sciweavers

7 search results - page 1 / 2
» The First Order Theories of the Medvedev and Muchnik Lattice...
Sort
View
CIE
2009
Springer
13 years 8 months ago
The First Order Theories of the Medvedev and Muchnik Lattices
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
JSYML
2008
112views more  JSYML 2008»
13 years 4 months ago
On the structure of the Medvedev lattice
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite B...
Sebastiaan Terwijn
AML
2010
99views more  AML 2010»
13 years 4 months ago
Effectively inseparable Boolean algebras in lattices of sentences
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
V. Yu. Shavrukov
SIBGRAPI
1999
IEEE
13 years 8 months ago
Developing Morphological Building Blocks: From Design to Implementation
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
Marcos Cordeiro d'Ornellas, Rein van den Boomgaard
CLA
2007
13 years 5 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig