| | |
Thomas Forster
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 22 |      | Thomas Forster, Thierry Libert: An Order-Theoretic Account of Some Set-Theoretic Paradoxes. Notre Dame Journal of Formal Logic 52(1): 1-19 (2011) |
| 2009 | ||
| 21 | | Nathan Bowler, Thomas Forster: Normal subgroups of infinite symmetric groups, with an application to stratified set theory. J. Symb. Log. 74(1): 17-26 (2009) |
| 2008 | ||
| 20 | | Kentaro Yoshimura, Thomas Forster, Dirk Muthig, Daniel Pech: Model-Based Design of Product Line Components in the Automotive Domain. SPLC 2008: 170-179 |
| 19 | | Thomas Forster, Dirk Muthig, Daniel Pech: Understanding Decision Models – Visualization and Complexity Reduction of Software Variability. VaMoS 2008: 111-119 |
| 18 | | Thomas Forster: Sharvy's Lucy and Benjamin Puzzle. Studia Logica 90(2): 249-256 (2008) |
| 2007 | ||
| 17 | | Thomas E. Forster, J. K. Truss: Ramsey's theorem and König's Lemma. Arch. Math. Log. 46(1): 37-42 (2007) |
| 16 | | Thomas Forster: Erdos-Rado without choice. J. Symb. Log. 72(3): 897-900 (2007) |
| 2006 | ||
| 15 | | Thomas Forster: Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF. J. Symb. Log. 71(1): 227-240 (2006) |
| 2005 | ||
| 14 | | Jens Knodel, Thomas Forster, Jean-Francois Girard: Comparing Design Alternatives from Field-Tested Systems to Support Product Line Architecture Design. CSMR 2005: 344-353 |
| 13 | | Jens Knodel, Michalis Anastasopolous, Thomas Forster, Dirk Muthig: An Efficient Migration to Model-driven Development (MDD). Electr. Notes Theor. Comput. Sci. 137(3): 17-27 (2005) |
| 2003 | ||
| 12 |  | Thomas Forster: ZF + 'Every set is the same size as a wellfounded set'. J. Symb. Log. 68(1): 1-4 (2003) |
| 11 | | Thomas E. Forster, J. K. Truss: Non-well-foundedness of well-orderable power sets. J. Symb. Log. 68(3): 879-884 (2003) |
| 10 | | Thomas Forster: Finite-to-one maps. J. Symb. Log. 68(4): 1251-1253 (2003) |
| 9 | | Thomas Forster: Better-quasi-orderings and coinduction. Theor. Comput. Sci. 309(1-3): 111-123 (2003) |
| 1996 | ||
| 8 | | Thomas E. Forster, C. M. Rood: Sethood and Situations. Computational Linguistics 22(3): 405-408 (1996) |
| 1994 | ||
| 7 | | Thomas Forster: Weak Systems of Set Theory Related to HOL. TPHOLs 1994: 193-204 |
| 6 | | Thomas Forster: Letter: Why Set Theory Without Foundation? J. Log. Comput. 4(4): 333-335 (1994) |
| 1993 | ||
| 5 | | Thomas Forster: A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus. Theor. Comput. Sci. 110(2): 405-418 (1993) |
| 1991 | ||
| 4 | | Thomas Forster, Richard Kaye: End-Extensions Preserving Power Set. J. Symb. Log. 56(1): 323-328 (1991) |
| 1987 | ||
| 3 | | Thomas E. Forster: Term Models for Weak Set Theories with a Universal Set. J. Symb. Log. 52(2): 374-387 (1987) |
| 1985 | ||
| 2 | | Thomas E. Forster: The Status of the Axiom of Choice in Set Theory with a Universal Set. J. Symb. Log. 50(3): 701-707 (1985) |
| 1983 | ||
| 1 | | Thomas E. Forster: Further Consistency and Independence Results in NF Obtained by the Permutation Method. J. Symb. Log. 48(2): 236-238 (1983) |
| 1 | Michalis Anastasopolous | [13] |
| 2 | Nathan Bowler | [21] |
| 3 | Jean-Francois Girard | [14] |
| 4 | Richard Kaye | [4] |
| 5 | Jens Knodel | [13] [14] |
| 6 | Thierry Libert | [22] |
| 7 | Dirk Muthig | [13] [19] [20] |
| 8 | Daniel Pech | [19] [20] |
| 9 | C. M. Rood | [8] |
| 10 | J. K. Truss | [11] [17] |
| 11 | Kentaro Yoshimura | [20] |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page