Further Consistency and Independence Results in NF Obtained by the Permutation Method. - Thomas E. Forster (J. Symb. Log., 1983)

The Status of the Axiom of Choice in Set Theory with a Universal Set. - Thomas E. Forster (J. Symb. Log., 1985)

Term Models for Weak Set Theories with a Universal Set. - Thomas E. Forster (J. Symb. Log., 1987)

Permutation Models in the Sense of Rieger-Bernays. - Thomas E. Forster (Math. Log. Q., 1987)

A Consistent Higher-Order Theory Without a (Higher-Order) Model. - Thomas Forster (Math. Log. Q., 1989)

Permutations and stratified formulae a preservation theorem. - Thomas Forster (Math. Log. Q., 1990)

End-Extensions Preserving Power Set. - Thomas Forster; Richard Kaye (J. Symb. Log., 1991)

A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus. - Thomas Forster (Theor. Comput. Sci., 1993)

Weak Systems of Set Theory Related to HOL. - Thomas Forster (TPHOLs, 1994)

Letter: Why Set Theory Without Foundation? - Thomas Forster (J. Log. Comput., 1994)

Sethood and Situations. - Thomas E. Forster; C. M. Rood (Comput. Linguistics, 1996)

Logic, Induction and Sets. - Thomas E. Forster (Cambridge University Press, 2003)

ZF + 'Every set is the same size as a wellfounded set'. - Thomas Forster (J. Symb. Log., 2003)

Finite-to-one maps. - Thomas Forster (J. Symb. Log., 2003)

Non-well-foundedness of well-orderable power sets. - Thomas E. Forster; John Kenneth Truss (J. Symb. Log., 2003)

Better-quasi-orderings and coinduction. - Thomas Forster (Theor. Comput. Sci., 2003)

Reasoning About Theoretical Entities - Thomas Forster (World Scientific, 2003)

An Efficient Migration to Model-driven Development (MDD). - Jens Knodel; Michalis Anastasopolous; Thomas Forster; Dirk Muthig (ateM, 2004)

Comparing Design Alternatives from Field-Tested Systems to Support Product Line Architecture Design. - Jens Knodel; Thomas Forster; Jean-Francois Girard (CSMR, 2005)

Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF. - Thomas Forster (J. Symb. Log., 2006)

Ramsey's theorem and König's Lemma. - Thomas E. Forster; John Kenneth Truss (Arch. Math. Log., 2007)

Erdos-Rado without choice. - Thomas Forster (J. Symb. Log., 2007)

Model-Based Design of Product Line Components in the Automotive Domain. - Kentaro Yoshimura; Thomas Forster; Dirk Muthig; Daniel Pech (SPLC, 2008)

Understanding Decision Models - Visualization and Complexity Reduction of Software Variability. - Thomas Forster; Dirk Muthig; Daniel Pech (VaMoS, 2008)

The iterative conception of Set. - Thomas Forster (Rev. Symb. Log., 2008)

Sharvy's Lucy and Benjamin Puzzle. - Thomas Forster (Stud Logica, 2008)

Normal subgroups of infinite symmetric groups, with an application to stratified set theory. - Nathan J. Bowler; Thomas Forster (J. Symb. Log., 2009)

An Order-Theoretic Account of Some Set-Theoretic Paradoxes. - Thomas Forster; Thierry Libert (Notre Dame J. Formal Log., 2011)

Alternative Set Theories. - M. Randall Holmes; Thomas E. Forster; Thierry Libert (Sets and Extensions in the Twentieth Century, 2012)

Recovering Component Dependencies Hidden by Frameworks-Experiences from Analyzing OSGi and Qt. - Thomas Forster; Thorsten Keuler; Jens Knodel; Michael-Christian Becker (CSMR, 2013)

FERAL - Framework for simulator coupling on requirements and architecture level. - Thomas Kuhn 001; Thomas Forster; Tobias Braun; Reinhard Gotzhein (MEMOCODE, 2013)

A Note on Freedom from Detachment in the Logic of Paradox. - J. C. Beall; Thomas Forster; Jeremy Seligman (Notre Dame J. Formal Log., 2013)

Recovering Runtime Structures of Software Systems from Static Source Code. - Thomas Forster; Thorsten Keuler; Jens Knodel (Softwaretechnik-Trends, 2013)

Decidable Fragments of the Simple Theory of Types with Infinity and NF. - Anuj Dawar; Thomas Forster; Zachiri McKenzie (Notre Dame J. Formal Log., 2017)

Automated Parliaments: A Solution to Decision Uncertainty and Misalignment in Language Models. - Thomas Forster; Jonathan Ouwerx; Shak Ragoler (CoRR, 2023)