JSYML 2008 - PDF Preprint Papers

JSYML 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JSYML-2008 Paper

click to vote

JSYML
2008

112views more JSYML 2008»

On the structure of the Medvedev lattice

14 years 12 days ago

Download staff.science.uva.nl

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	112	On the structure of the Medvedev lattice	claim
2	112	Internal consistency for embedding complexity	claim
3	109	Closed fragments of provability logics of constructive theories	claim
4	108	Randomness, lowness and degrees	claim
5	105	Finite state automata and monadic definability of singular cardinals	claim
6	100	Measurable chromatic numbers	claim
7	98	Combinatorial images of sets of reals and semifilter trichotomy	claim
8	95	Examples of non-locality	claim
9	89	The degree spectra of homogeneous models	claim
10	86	On Skolemization in constructive theories	claim
11	84	The modal logic of affine planes is not finitely axiomatisable	claim
12	82	The number of openly generated Boolean algebras	claim
13	79	Coding complete theories in Galois groups	claim
14	78	Hierarchies of forcing axioms I	claim
15	78	Closed maximality principles: implications, separations and combinations	claim
16	74	Omitting types for finite variable fragments and complete representations of algebras	claim
17	73	Examining fragments of the quantified propositional calculus	claim
18	72	Perfect trees and elementary embeddings	claim
19	71	Regular ultrafilters and finite square principles	claim
20	71	Strictly positive measures on Boolean algebras	claim
21	69	Aronszajn lines and the club filter	claim
22	68	Some pathological examples of precipitous ideals	claim
23	66	Flat algebras and the translation of universal Horn logic to equational logic	claim
24	66	Special groups whose isometry relation is a finite union of cosets	claim
25	66	Scales in K(R) at the end of a weak gap	claim
26	63	Classifying model-theoretic properties	claim
27	63	Borel complexity of isomorphism between quotient Boolean algebras	claim
28	60	On the consistency strength of the inner model hypothesis	claim
29	60	on the singular cardinals	claim
30	56	On metric types that are definable in an o-minimal structure	claim
31	53	The polynomial and linear hierarchies in models where the weak pigeonhole principle fails	claim
32	53	On very high degrees	claim
33	52	Hierarchies of forcing axioms II	claim
34	51	Scott's problem for Proper Scott sets	claim
35	50	Strongly unfoldable cardinals made indestructible	claim
36	50	Analytic and coanalytic families of almost disjoint functions	claim
37	45	How enumeration reducibility yields extended Harrington non-splitting	claim
38	45	Internal consistency and global co-stationarity of the ground model	claim
39	44	Prime models of computably enumerable degree	claim
40	41	Weakly pointed trees and partial injections	claim
41	38	Semistationary and stationary reflection	claim
42	33	A note on standard systems and ultrafilters	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers