Sciweavers

APAL
2006
85views more  APAL 2006»
13 years 11 months ago
Compact spaces, elementary submodels, and the countable chain condition
Given a space X, J in an elementary submodel M of H(), define XM to be X M with the topology generated by {U M : U J M}. It is established, using anti-large-cardinals assumptio...
Lúcia R. Junqueira, Paul Larson, Franklin D...
APAL
2006
70views more  APAL 2006»
13 years 11 months ago
On the Hamkins approximation property
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
William J. Mitchell
APAL
2006
44views more  APAL 2006»
13 years 11 months ago
The metamathematics of random graphs
John T. Baldwin
APAL
2006
79views more  APAL 2006»
13 years 11 months ago
Cardinal invariants related to permutation groups
We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: ag := the least cardina...
Bart Kastermans, Yi Zhang 0008
APAL
2006
74views more  APAL 2006»
13 years 11 months ago
An Aristotelian notion of size
The na
Vieri Benci, Mauro Di Nasso, Marco Forti
APAL
2006
66views more  APAL 2006»
13 years 11 months ago
Uncountable categoricity of local abstract elementary classes with amalgamation
BLE CATEGORICITY OF LOCAL ABSTRACT ELEMENTARY CLASSES WITH AMALGAMATION JOHN T. BALDWIN AND OLIVIER LESSMANN We give a complete and elementary proof of the following upward categor...
John T. Baldwin, Olivier Lessmann
APAL
2006
50views more  APAL 2006»
13 years 11 months ago
Independence in finitary abstract elementary classes
ence in Finitary Abstract Elementary Classes Tapani Hyttinen and Meeri Kes
Tapani Hyttinen, M. Kesälä
APAL
2006
76views more  APAL 2006»
13 years 11 months ago
Non-primitive recursive decidability of products of modal logics with expanding domains
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
David Gabelaia, Agi Kurucz, Frank Wolter, Michael ...
APAL
2006
113views more  APAL 2006»
13 years 11 months ago
Coding by club-sequences
Given any subset A of 1 there is a proper partial order which forces that the predicate x A and the predicate x 1\A can be expressed by ZFC
David Asperó
APAL
2006
66views more  APAL 2006»
13 years 11 months ago
The Skolemization of existential quantifiers in intuitionistic logic
In this paper an alternative Skolemization method is introduced that for a large class of formulas is sound and complete with respect to intuitionistic logic. This class extends t...
Matthias Baaz, Rosalie Iemhoff