Andrea Cantini, First Steps into Metapredicativity in Explicit...
philpapers.org
Thomas Strahm Journal of Symbolic Logic 67 (1): The [Mathematical Formula] Quantification Operator in Explicit Mathematics with Universes and …
Fernando Ferreira, Review: Thomas Strahm, Polynomial Time Operations...
philpapers.org
Review: Thomas Strahm, Polynomial Time Operations in Explicit Mathematics ; Andrea Cantini, Feasible Operations and Applicative Theories Based on ...
Thomas Strahm, Tupailo Sergei. Realization of analysis into explicit...
philpapers.org
Fernando Ferreira (2002). Strahm Thomas. Polynomial Time Operations in Explicit Mathematics. The Journal of Symbolic Logic, Vol. 62 (1997), Pp. 575–594.
Thomas Strahm, Wellordering proofs for metapredicative mahlo -...
philpapers.org
In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about...
One Hundred Years of Russell ́s Paradox: Mathematics, Logic,...
books.google.de
J'ager, Gerhard, Reinhard Kahle, Anton Setzer and Thomas Strahm: The prooftheoretic analysis of transfinitely iterated fixed point theories. The Journal of ...
Logic and Foundations of Mathematics: Selected Contributed Papers of...
books.google.ca
The IOth International Congress of Logic, Methodology and Philosophy of Science, which took place in Florence in August 1995, offered a vivid and comprehensive...
Concepts of Proof in Mathematics, Philosophy, and Computer Science -...
books.google.ca
A proof is a successful demonstration that a conclusion necessarily follows by logical reasoning from axioms which are considered evident for the given context...
Concepts of Proof in Mathematics, Philosophy, and Computer Science
books.google.de
Gerhard Jäger, and Thomas Strahm ... Gerhard Jäger and Thomas Strahm: Institut für Informatik, Universität BernBern, Switzerland, ...
Gla and Thomas Strahm - CiteSeerX
citeseerx.ist.psu.edu
Systems of explicit mathematics with non-constructiv e -op erator and join Thomas Gla and Strahm Abstract The aim of this article is to giv e the pro of-theoretic analysis
Download as a PDF
oslab.ch
Proof-theoretic contributions to explicit mathematics. Habilitationsschrift. Thomas Strahm. Institut für Informatik und angewandte Mathematik. Universität Bern.
Polynomial time operations in explicit mathematics - CORE
core.ac.uk
Thomas Strahm . By Thomas Strahm. Abstract. Polynomial time operations in explicit mathematics Publisher: Year: OAI identifier: oai:CiteSeerX.psu:
A Theory of Explicit Mathematics Equivalent to ID1 | SpringerLink
link.springer.com
We show that the addition of name induction to the theory [equation] of explicit elementary types with join yields a theory proof-theoretically equivalent to...
Google Groups: Stanford Mathematics Seminars week of April 6th
: ... Networks" ********** TUESDAY, APRIL 7 LOGIC SEMINAR 4:15 PM, 381-T
All web results to the name "Thomas Strahm"
Ferreira : Review: Thomas Strahm, Polynomial Time Operations in...
projecteuclid.org
Project Euclid - mathematics and statistics online
Thomas Strahm - The Mathematics Genealogy Project
www.mathgenealogy.org
According to our current on-line database, Thomas Strahm has 4 students and 4 descendants. We welcome any additional information. If you have additional ...
The Bulletin of Symbolic Logic, Volume 9
www.math.ucla.edu
The Bulletin of Symbolic Logic Volume 9, The Reviews, ... S. Tupailo, Realization of analysis into explicit mathematics, reviewed by Thomas Strahm, page 42.
The Bulletin of Symbolic Logic, Volume 8 - UCLA Department of ...
www.math.ucla.edu
A. Weiermann, How is it that infinitary methods can be applied to finitary mathematics? reviewed by Thomas Strahm, page U. Kohlenbach, Relative ...
The Unfolding Program, Explicit Mathematics, Open-Ended...
www.templeton.org
The first part is to be carried out in continued active collaboration with Gerhard Jaeger and Thomas Strahm of the University of Bern. The three parts are to be ...
Seminars: Thomas Strahm, Types and truth in weak applicative theories
www.mathnet.ru
Abstract: In this talk we survey recent developments in the study of prooftheoretically weak systems of Feferman's explicit mathematics and ...
sorted by relevance / date