JSYML 2007 - PDF Preprint Papers

JSYML 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JSYML-2007 Paper

click to vote

JSYML
2007

106views more JSYML 2007»

Characterizing rosy theories

13 years 4 months ago

Download www.math.uiuc.edu

We examine several conditions, either the existence of a rank or a particular property of þ-forking that suggest the existence of a well-behaved independence relation, and determi...

Clifton Ealy, Alf Onshuus

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	106	Characterizing rosy theories	claim
2	100	Combinatorial principles weaker than Ramsey's Theorem for pairs	claim
3	97	Sublocales in formal topology	claim
4	95	Applications of Kolmogorov complexity to computable model theory	claim
5	91	Ideal convergence of bounded sequences	claim
6	88	The basic intuitionistic logic of proofs	claim
7	85	Substructural fuzzy logics	claim
8	85	Lower bounds for modal logics	claim
9	80	Theories very close to PA where Kreisel's Conjecture is false	claim
10	79	Non-branching degrees in the Medvedev lattice of Pi01 classes	claim
11	79	Models of non-well-founded sets via an indexed final coalgebra theorem	claim
12	78	The settling-time reducibility ordering	claim
13	75	Stable definability and generic relations	claim
14	74	A power function with a fixed finite gap everywhere	claim
15	73	The ground axiom	claim
16	70	Winning the pressing down game but not Banach-Mazur	claim
17	68	Bounding nonsplitting enumeration degrees	claim
18	68	Reconstruction of homogeneous relational structures	claim
19	66	Spectra of structures and relations	claim
20	62	A reduction of the NF consistency problem	claim
21	58	Bounding homogeneous models	claim
22	57	Red fields	claim
23	52	Maximal chains in the Turing degrees	claim
24	51	Forcing indestructibility of set-theoretic axioms	claim
25	51	Approximate counting in bounded arithmetic	claim
26	51	Some results in polychromatic Ramsey theory	claim
27	50	Erdos-Rado without choice	claim
28	49	On sets not belonging to algebras	claim
29	48	An analysis of the W*-hierarchy	claim
30	48	Flag algebras	claim
31	44	Classifying Borel automorphisms	claim
32	44	Completeness of MLL proof-nets w.r.t. weak distributivity	claim
33	43	Successor-invariant first-order logic on finite structures	claim
34	42	Asymptotic classes of finite structures	claim
35	41	NP search problems in low fragments of bounded arithmetic	claim
36	40	Parallel interpolation, splitting, and relevance in belief change	claim
37	37	Transfer principle in quantum set theory	claim
38	36	Groups definable in ordered vector spaces over ordered division rings	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers