Thomas Forster

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 2

Top Topics

Software Systems

Development Effort

Top Venues

Notre Dame J. Formal Log.

Softwaretechnik-Trends

Publications

Thomas Forster, Jonathan Ouwerx, Shak Ragoler
Automated Parliaments: A Solution to Decision Uncertainty and Misalignment in Language Models. CoRR (2023)
Anuj Dawar, Thomas Forster, Zachiri McKenzie
Decidable Fragments of the Simple Theory of Types with Infinity and NF. Notre Dame J. Formal Log. 58 (3) (2017)
Thomas Forster, Thorsten Keuler, Jens Knodel, Michael-Christian Becker
Recovering Component Dependencies Hidden by Frameworks-Experiences from Analyzing OSGi and Qt. CSMR (2013)
Thomas Forster, Thorsten Keuler, Jens Knodel
Recovering Runtime Structures of Software Systems from Static Source Code. Softwaretechnik-Trends 33 (2) (2013)
Thomas Kuhn, Thomas Forster, Tobias Braun, Reinhard Gotzhein
FERAL - Framework for simulator coupling on requirements and architecture level. MEMOCODE (2013)
J. C. Beall, Thomas Forster, Jeremy Seligman
A Note on Freedom from Detachment in the Logic of Paradox. Notre Dame J. Formal Log. 54 (1) (2013)
Thomas Forster, Thierry Libert
An Order-Theoretic Account of Some Set-Theoretic Paradoxes. Notre Dame J. Formal Log. 52 (1) (2011)
Nathan J. Bowler, Thomas Forster
Normal subgroups of infinite symmetric groups, with an application to stratified set theory. J. Symb. Log. 74 (1) (2009)
Thomas Forster
The iterative conception of Set. Rev. Symb. Log. 1 (1) (2008)
Thomas Forster
Sharvy's Lucy and Benjamin Puzzle. Stud Logica 90 (2) (2008)
Kentaro Yoshimura, Thomas Forster, Dirk Muthig, Daniel Pech
Model-Based Design of Product Line Components in the Automotive Domain. SPLC (2008)
Thomas Forster, Dirk Muthig, Daniel Pech
Understanding Decision Models - Visualization and Complexity Reduction of Software Variability. VaMoS (2008)
Thomas Forster
Erdos-Rado without choice. J. Symb. Log. 72 (3) (2007)
Thomas Forster
Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF. J. Symb. Log. 71 (1) (2006)
Jens Knodel, Thomas Forster, Jean-Francois Girard
Comparing Design Alternatives from Field-Tested Systems to Support Product Line Architecture Design. CSMR (2005)
Jens Knodel, Michalis Anastasopolous, Thomas Forster, Dirk Muthig
An Efficient Migration to Model-driven Development (MDD). Electron. Notes Theor. Comput. Sci. 137 (3) (2005)
Thomas Forster
Finite-to-one maps. J. Symb. Log. 68 (4) (2003)
Thomas Forster
ZF + 'Every set is the same size as a wellfounded set'. J. Symb. Log. 68 (1) (2003)
Thomas Forster
Better-quasi-orderings and coinduction. Theor. Comput. Sci. 309 (1-3) (2003)
Thomas Forster
Weak Systems of Set Theory Related to HOL. TPHOLs (1994)
Thomas Forster
Letter: Why Set Theory Without Foundation? J. Log. Comput. 4 (4) (1994)
Thomas Forster
A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus. Theor. Comput. Sci. 110 (2) (1993)
Thomas Forster, Richard Kaye
End-Extensions Preserving Power Set. J. Symb. Log. 56 (1) (1991)
Thomas Forster
Permutations and stratified formulae a preservation theorem. Math. Log. Q. 36 (5) (1990)
Thomas Forster
A Consistent Higher-Order Theory Without a (Higher-Order) Model. Math. Log. Q. 35 (5) (1989)