default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Strahm
Person information
- affiliation: University of Bern, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j27]Florian Ranzi, Thomas Strahm
:
A flexible type system for the small Veblen ordinal. Arch. Math. Log. 58(5-6): 711-751 (2019)- 2016
- [j26]Thomas Strahm:
Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 pp. Bull. Symb. Log. 22(2): 288-289 (2016) - 2014
- [j25]Florian Ranzi, Thomas Strahm:
A note on the theory SID<ω of stratified induction. Math. Log. Q. 60(6): 487-497 (2014) - 2011
- [j24]Dieter Probst, Thomas Strahm:
Admissible closures of polynomial time computable arithmetic. Arch. Math. Log. 50(5-6): 643-660 (2011) - [j23]Daria Spescha, Thomas Strahm:
Realisability in weak systems of explicit mathematics. Math. Log. Q. 57(6): 551-565 (2011) - 2010
- [j22]Solomon Feferman, Thomas Strahm:
Unfolding Finitist Arithmetic. Rev. Symb. Log. 3(4): 665-689 (2010)
2000 – 2009
- 2009
- [j21]Daria Spescha, Thomas Strahm:
Elementary explicit types and polynomial time operations. Math. Log. Q. 55(3): 245-258 (2009) - 2008
- [j20]Thomas Strahm, Jeffery I. Zucker:
Primitive recursive selection functions for existential assertions over abstract algebras. J. Log. Algebraic Methods Program. 76(2): 175-197 (2008) - 2006
- [j19]David Steiner, Thomas Strahm:
On the proof theory of type two functionals based on primitive recursive operations. Math. Log. Q. 52(3): 237-252 (2006) - 2005
- [j18]Gerhard Jäger, Thomas Strahm:
Reflections on reflections in explicit mathematics. Ann. Pure Appl. Log. 136(1-2): 116-133 (2005) - 2004
- [j17]Thomas Strahm:
A proof-theoretic characterization of the basic feasible functionals. Theor. Comput. Sci. 329(1-3): 159-176 (2004) - 2003
- [j16]Thomas Strahm:
Theories with self-application and computational complexity. Inf. Comput. 185(2): 263-297 (2003) - 2002
- [j15]Thomas Strahm:
Wellordering Proofs for Metapredicative Mahlo. J. Symb. Log. 67(1): 260-278 (2002) - [j14]Christian Rüede, Thomas Strahm:
Intuitionistic Fixed Point Theories for Strictly Positive Operators. Math. Log. Q. 48(2): 195-202 (2002) - 2001
- [j13]Gerhard Jäger, Thomas Strahm:
Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory. J. Symb. Log. 66(2): 935-958 (2001) - 2000
- [j12]Gerhard Jäger, Thomas Strahm:
Fixed point theories and dependent choice. Arch. Math. Log. 39(7): 493-508 (2000) - [j11]Solomon Feferman, Thomas Strahm:
The unfolding of non-finitist arithmetic. Ann. Pure Appl. Log. 104(1-3): 75-96 (2000) - [j10]Thomas Strahm:
The non-constructive mu operator, fixed point theories with ordinals, and the bar rule. Ann. Pure Appl. Log. 104(1-3): 305-324 (2000)
1990 – 1999
- 1999
- [j9]Gerhard Jäger, Thomas Strahm:
Bar Induction and omega Model Reflection. Ann. Pure Appl. Log. 97(1-3): 221-230 (1999) - [j8]Gerhard Jäger, Reinhard Kahle, Anton Setzer, Thomas Strahm:
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories. J. Symb. Log. 64(1): 53-67 (1999) - 1998
- [j7]Markus Marzetta, Thomas Strahm:
The m\mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. Arch. Math. Log. 37(5-6): 391-413 (1998) - 1997
- [j6]Thomas Strahm:
Polynomial Time Operations in Explicit Mathematics. J. Symb. Log. 62(2): 575-594 (1997) - 1996
- [j5]Thomas Glaß, Thomas Strahm:
Systems of Explicit Mathematics with Non-Constructive µ-Operator and Join. Ann. Pure Appl. Log. 82(2): 193-219 (1996) - [j4]Gerhard Jäger, Thomas Strahm:
Some Theories with Positive Induction of Ordinal Strength phi omega 0. J. Symb. Log. 61(3): 818-842 (1996) - [j3]Thomas Strahm:
Partial Applicative Theories and Explicit Substitutions. J. Log. Comput. 6(1): 55-77 (1996) - 1995
- [j2]Gerhard Jäger, Thomas Strahm:
Second order theories with ordinals and elementary comprehension. Arch. Math. Log. 34(6): 345-375 (1995) - [j1]Gerhard Jäger, Thomas Strahm:
Totality in Applicative Theories. Ann. Pure Appl. Log. 74(2): 105-120 (1995)
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-25 05:47 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:
