Thomas Forster

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