default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas E. Forster
Person information
- affiliation: University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Thomas Forster, Jonathan Ouwerx, Shak Ragoler:
Automated Parliaments: A Solution to Decision Uncertainty and Misalignment in Language Models. CoRR abs/2311.10098 (2023)
2010 – 2019
- 2017
- [j24]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): 433-451 (2017) - 2013
- [j23]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): 15-20 (2013) - [j22]Thomas Forster, Thorsten Keuler, Jens Knodel:
Recovering Runtime Structures of Software Systems from Static Source Code. Softwaretechnik-Trends 33(2) (2013) - [c7]Thomas Forster, Thorsten Keuler, Jens Knodel, Michael-Christian Becker:
Recovering Component Dependencies Hidden by Frameworks-Experiences from Analyzing OSGi and Qt. CSMR 2013: 295-304 - [c6]Thomas Kuhn, Thomas Forster, Tobias Braun, Reinhard Gotzhein:
FERAL - Framework for simulator coupling on requirements and architecture level. MEMOCODE 2013: 11-22 - 2012
- [r1]M. Randall Holmes, Thomas E. Forster, Thierry Libert:
Alternative Set Theories. Sets and Extensions in the Twentieth Century 2012: 559-632 - 2011
- [j21]Thomas Forster, Thierry Libert:
An Order-Theoretic Account of Some Set-Theoretic Paradoxes. Notre Dame J. Formal Log. 52(1): 1-19 (2011)
2000 – 2009
- 2009
- [j20]Nathan J. 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
- [j19]Thomas Forster:
The iterative conception of Set. Rev. Symb. Log. 1(1): 97-110 (2008) - [j18]Thomas Forster:
Sharvy's Lucy and Benjamin Puzzle. Stud Logica 90(2): 249-256 (2008) - [c5]Kentaro Yoshimura, Thomas Forster, Dirk Muthig, Daniel Pech:
Model-Based Design of Product Line Components in the Automotive Domain. SPLC 2008: 170-179 - [c4]Thomas Forster, Dirk Muthig, Daniel Pech:
Understanding Decision Models - Visualization and Complexity Reduction of Software Variability. VaMoS 2008: 111-119 - 2007
- [j17]Thomas E. Forster, John Kenneth Truss:
Ramsey's theorem and König's Lemma. Arch. Math. Log. 46(1): 37-42 (2007) - [j16]Thomas Forster:
Erdos-Rado without choice. J. Symb. Log. 72(3): 897-900 (2007) - 2006
- [j15]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
- [c3]Jens Knodel, Thomas Forster, Jean-Francois Girard:
Comparing Design Alternatives from Field-Tested Systems to Support Product Line Architecture Design. CSMR 2005: 344-353 - 2004
- [c2]Jens Knodel, Michalis Anastasopolous, Thomas Forster, Dirk Muthig:
An Efficient Migration to Model-driven Development (MDD). ateM 2004: 17-27 - 2003
- [b2]Thomas E. Forster:
Logic, Induction and Sets. London Mathematical Society student texts 56, Cambridge University Press 2003, ISBN 978-0-521-53361-4, pp. I-X, 1-234 - [b1]Thomas Forster:
Reasoning About Theoretical Entities. Advances in Logic 3, World Scientific 2003, ISBN 978-981-238-567-3, pp. 1-100 - [j14]Thomas Forster:
ZF + 'Every set is the same size as a wellfounded set'. J. Symb. Log. 68(1): 1-4 (2003) - [j13]Thomas E. Forster, John Kenneth Truss:
Non-well-foundedness of well-orderable power sets. J. Symb. Log. 68(3): 879-884 (2003) - [j12]Thomas Forster:
Finite-to-one maps. J. Symb. Log. 68(4): 1251-1253 (2003) - [j11]Thomas Forster:
Better-quasi-orderings and coinduction. Theor. Comput. Sci. 309(1-3): 111-123 (2003)
1990 – 1999
- 1996
- [j10]Thomas E. Forster, C. M. Rood:
Sethood and Situations. Comput. Linguistics 22(3): 405-408 (1996) - 1994
- [j9]Thomas Forster:
Letter: Why Set Theory Without Foundation? J. Log. Comput. 4(4): 333-335 (1994) - [c1]Thomas Forster:
Weak Systems of Set Theory Related to HOL. TPHOLs 1994: 193-204 - 1993
- [j8]Thomas Forster:
A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus. Theor. Comput. Sci. 110(2): 405-418 (1993) - 1991
- [j7]Thomas Forster, Richard Kaye:
End-Extensions Preserving Power Set. J. Symb. Log. 56(1): 323-328 (1991) - 1990
- [j6]Thomas Forster:
Permutations and stratified formulae a preservation theorem. Math. Log. Q. 36(5): 385-388 (1990)
1980 – 1989
- 1989
- [j5]Thomas Forster:
A Consistent Higher-Order Theory Without a (Higher-Order) Model. Math. Log. Q. 35(5): 385-386 (1989) - 1987
- [j4]Thomas E. Forster:
Term Models for Weak Set Theories with a Universal Set. J. Symb. Log. 52(2): 374-387 (1987) - [j3]Thomas E. Forster:
Permutation Models in the Sense of Rieger-Bernays. Math. Log. Q. 33(3): 201-210 (1987) - 1985
- [j2]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
- [j1]Thomas E. Forster:
Further Consistency and Independence Results in NF Obtained by the Permutation Method. J. Symb. Log. 48(2): 236-238 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
