EDBT 2026 Demo / reviewers in the wild / expert
Franklin D. Tall
dblp:59/4919
· DBLP profile ↗
5ranked-venue papers
1as first author
3since 2021 · last 2023
0000-0003-3105-4506ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 1 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | An undecidable extension of Morley's theorem on the number of countable models
Christopher J. Eagle, Clovis Hamel, Sandra Müller, Franklin D. Tall |
Ann. Pure Appl. Log. | 4 |
| 2021 | Two applications of topology to model theory
Christopher J. Eagle, Clovis Hamel, Franklin D. Tall |
Ann. Pure Appl. Log. | 3 |
| 2021 | Introduction
Franklin D. Tall |
Ann. Pure Appl. Log. | 1 |
| 2006 | Compact spaces, elementary submodels, and the countable chain condition
Lúcia R. Junqueira, Paul B. Larson, Franklin D. Tall |
Ann. Pure Appl. Log. | 3 |
| 2000 | The Real Line in Elementary Submodels of Set TheoryabstractThe use of elementary submodels has become a standard tool in set-theoretic topology and infinitary combinatorics. Thus, in studying some combinatorial objects, one embeds them in a set, M, which is an elementary submodel of the universe, V (that is, (M; Є) ≺ (V; Є)). Applying the downward Löwenheim-Skolem Theorem, one can bound the cardinality of M. This tool enables one to capture various complicated closure arguments within the simple “≺”. However, in this paper, as in the paper [JT], we study the tool for its own sake. [JT] discussed various general properties of topological spaces in elementary submodels. In this paper, we specialize this consideration to the space of real numbers, ℝ. Our models M are not in general transitive. We will always have ℝ Є M, but not usually ℝ ⊆ M. We plan to study properties of the ℝ ⋂ M's. In particular, as M varies, we wish to study whether any two of these ℝ ⋂ M's are isomorphic as topological spaces, linear orders, or fields. As usual, it takes some sleight-of-hand to formalize these notions within the standard axioms of set theory (ZFC), since within ZFC, one cannot actually define the notion (M;Є) ≺ (V;Є). Instead, one proves theorems about M such that (M;Є) ≺ (H(θ);Є), where θ is a “large enough” cardinal; here, H(θ) is the collection of all sets whose transitive closure has size less than θ. Kenneth Kunen, Franklin D. Tall |
J. Symb. Log. | 2 |