Thomas E. Forster

According to our database, Thomas E. Forster authored at least 35 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Automated Parliaments: A Solution to Decision Uncertainty and Misalignment in Language Models.

Thomas Forster, Jonathan Ouwerx, Shak Ragoler

CoRR, 2023

2017

Decidable Fragments of the Simple Theory of Types with Infinity and NF.

Anuj Dawar, Thomas Forster, Zachiri McKenzie

Notre Dame J. Formal Log., 2017

2013

Recovering Runtime Structures of Software Systems from Static Source Code.

Thomas Forster, Thorsten Keuler, Jens Knodel

Softwaretechnik-Trends, 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

FERAL - Framework for simulator coupling on requirements and architecture level.

Thomas Kuhn, Thomas Forster, Tobias Braun, Reinhard Gotzhein

Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2013

Recovering Component Dependencies Hidden by Frameworks-Experiences from Analyzing OSGi and Qt.

Thomas Forster, Thorsten Keuler, Jens Knodel, Michael-Christian Becker

Proceedings of the 17th European Conference on Software Maintenance and Reengineering, 2013

2012

Alternative Set Theories.

M. Randall Holmes, Thomas E. Forster, Thierry Libert

Proceedings of the Sets and Extensions in the Twentieth Century, 2012

2011

An Order-Theoretic Account of Some Set-Theoretic Paradoxes.

Thomas Forster, Thierry Libert

Notre Dame J. Formal Log., 2011

2009

Normal subgroups of infinite symmetric groups, with an application to stratified set theory.

Nathan J. Bowler, Thomas Forster

J. Symb. Log., 2009

2008

Sharvy's Lucy and Benjamin Puzzle.

Thomas Forster

Stud Logica, 2008

The iterative conception of Set.

Thomas Forster

Rev. Symb. Log., 2008

Understanding Decision Models - Visualization and Complexity Reduction of Software Variability.

Thomas Forster, Dirk Muthig, Daniel Pech

Proceedings of the Second International Workshop on Variability Modelling of Software-Intensive Systems, 2008

Model-Based Design of Product Line Components in the Automotive Domain.

Kentaro Yoshimura, Thomas Forster, Dirk Muthig, Daniel Pech

Proceedings of the Software Product Lines, 12th International Conference, 2008

2007

Erdos-Rado without choice.

Thomas Forster

J. Symb. Log., 2007

Ramsey's theorem and König's Lemma.

Thomas E. Forster, John Kenneth Truss

Arch. Math. Log., 2007

2006

Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF.

Thomas Forster

J. Symb. Log., 2006

2005

Comparing Design Alternatives from Field-Tested Systems to Support Product Line Architecture Design.

Jens Knodel, Thomas Forster, Jean-Francois Girard

Proceedings of the 9th European Conference on Software Maintenance and Reengineering (CSMR 2005), 2005

2004

An Efficient Migration to Model-driven Development (MDD).

Jens Knodel, Michalis Anastasopolous, Thomas Forster, Dirk Muthig

Proceedings of the 2nd International Workshop on Metamodels, 2004

2003

Reasoning About Theoretical Entities

Thomas Forster

Advances in Logic 3, World Scientific, ISBN: 978-981-4485-27-2, 2003

Better-quasi-orderings and coinduction.

Thomas Forster

Theor. Comput. Sci., 2003

Non-well-foundedness of well-orderable power sets.

Thomas E. Forster, John Kenneth Truss

J. Symb. Log., 2003

Finite-to-one maps.

Thomas Forster

J. Symb. Log., 2003

ZF + 'Every set is the same size as a wellfounded set'.

Thomas Forster

J. Symb. Log., 2003

Logic, Induction and Sets.

Thomas E. Forster

London Mathematical Society student texts 56, Cambridge University Press, ISBN: 978-0-521-53361-4, 2003

1996

Sethood and Situations.

Thomas E. Forster, C. M. Rood

Comput. Linguistics, 1996

1994

Letter: Why Set Theory Without Foundation?

Thomas Forster

J. Log. Comput., 1994

Weak Systems of Set Theory Related to HOL.

Thomas Forster

Proceedings of the Higher Order Logic Theorem Proving and Its Applications, 1994

1993

A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus.

Thomas Forster

Theor. Comput. Sci., 1993

1991

End-Extensions Preserving Power Set.

Thomas Forster, Richard Kaye

J. Symb. Log., 1991

1990

Permutations and stratified formulae a preservation theorem.

Thomas Forster

Math. Log. Q., 1990

1989

A Consistent Higher-Order Theory Without a (Higher-Order) Model.

Thomas Forster

Math. Log. Q., 1989

1987

Permutation Models in the Sense of Rieger-Bernays.

Thomas E. Forster

Math. Log. Q., 1987

Term Models for Weak Set Theories with a Universal Set.

Thomas E. Forster

J. Symb. Log., 1987

1985

The Status of the Axiom of Choice in Set Theory with a Universal Set.

Thomas E. Forster

J. Symb. Log., 1985

1983

Further Consistency and Independence Results in NF Obtained by the Permutation Method.

Thomas E. Forster

J. Symb. Log., 1983