Sciweavers

103 search results - page 17 / 21
» jsyml 2006
Sort
View
JSYML
2006
87views more  JSYML 2006»
13 years 9 months ago
Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF
It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T-function which is peculiar to NF turn out to be equivalent to the truth-in-certain-...
Thomas Forster
JSYML
2006
79views more  JSYML 2006»
13 years 9 months ago
Local-global properties of positive primitive formulas in the theory of spaces of orderings
f spaces of signs (abstract real spectra) developed in [1] [18]. We consider pp (positive primitive) formulas in the language of reduced special groups as in [20]. We denote the pp...
M. Marshall
JSYML
2006
124views more  JSYML 2006»
13 years 9 months ago
Glivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Nikolaos Galatos, Hiroakira Ono
JSYML
2006
85views more  JSYML 2006»
13 years 9 months ago
On PAC and bounded substructures of a stable structure
We introduce and study the notions of a PAC substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [8]. We give precise definiti...
Anand Pillay, Dominika Polkowska
JSYML
2006
119views more  JSYML 2006»
13 years 9 months ago
0-D-valued fields
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
Nicolas Guzy