Explicit mathematics; theories of types and names; operational set theories; second order arithmetic; hither type recursion; operational set theory; higher type recursion
Jäger Gerhard, Studer Thomas (2011), A Buchholz rule for modal fixed point logics, in Logica Universalis
, 5(1), 1-19.
Probst Dieter, Strahm Thomas (2011), Admissible closures of polynomial time computable arithmetic, in Archive for Mathematical Logic
, 50(5-6), 643-660.
Juerg Kraehenbuehl (2011), On the relationship between choice schemes and iterated class comprehension in set theory (PhD dissertation)
, dissertation, Bern.
Spescha Daria, Strahm Thomas (2011), Realizability in weak systems of explicit mathematics, in Mathematical Logic Quarterly
, 57(6), 551-565.
Probst Dieter (2011), The provably terminating operations of the subsystem PETJ of explicit mathematics, in Annals of Pure and Applied Logic
, 162(11), 934-947.
Jäger Gerhard, Probst Dieter (2011), The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories, in Annalas of Pure and Apllied Logic
, 162(8), 647-660.
Jäger Gerhard, Krähenbühl Jürg (2010), $\Sigma^1_1$ choice in a theory of sets and classes, in Ways of Proof
, MünsterOntos Verlag, Frankfurt.
Feferman Solomon, Strahm Thomas (2010), Unfolding finitist arithmetic, in Review of Symbolic Logic
, 3(4), 665-689.
Strahm Thomas (2010), Weak theories of operations and types, in Ways of Proof
, MünsterOntos, Frankfurt.
Spescha Daria, Strahm Thomas (2009), Elementary explicit types and polynomial time operations, in Mathematical Logic Quarterly
, 55(3), 245-258.
Jäger Gerhard (2009), Full operational set theory with unbounded existential quantification and power set, in Annals of Pure and Applied Logic
, 160(1), 33-52.
Jäger Gerhard (2009), Operations, sets and classes, in Glymour C. Wei W. Westerstahl D. (ed.), College Publications, King's College, London, 74-96.
Spescha Daria (2009), Weak systems of explicit mathematics (PhD dissertation)
, Dissertation, Bern.
Brünnler Kai, McKinley Richard (2008), An algorithmic interpretation of a deep inference system, in Logic for Programming, Artificial Intelligence, and Reasoning
, Doha, QatarSpringer, Lecture Notes in Artificial Intelligence, 5330, Berlin.
Strahm Thomas, Zucker Jeff (2008), Primitive recursive selection functions for existential assertions over abstract algebras, in Journal of Logic and Algebraic Programming
, 76(2), 175-197.
McKinley Richard (2008), Soft linear set theory, in Journal of Logic and Algebraic Programming
, 76(2), 226-245.