- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Jörg Hudelmaier
6 found
Order:
- Bounds for cut elimination in intuitionistic propositional logic.Jörg Hudelmaier - 1992 - Archive for Mathematical Logic 31 (5):331-353.
- A contraction-free sequent calculus for S4.Jörg Hudelmaier - 1996 - In Heinrich Wansing (ed.), Proof theory of modal logic. Boston: Kluwer Academic Publishers. pp. 3--15.
- Jean Goubault-Larrecq and Ian Mackie. Proof theory and automated deduction. Applied logic series, vol. 6. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1997, xv + 424 pp. [REVIEW]Jörg Hudelmaier - 2000 - Bulletin of Symbolic Logic 6 (1):94-95.
- Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Wilfried Sieg, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence1990, xiv + 297 pp. - Douglas K. Brown. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50. - Kostas Hatzikiriakou and Stephen G. Simpson. WKL0 and orderings of countable abelian groups. Pp. 177–180. - Jeffry L. Hirst. Marriage theorems and reverse mathematics. Pp. 181–196. - Xiaokang Yu. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297. - Fernando Ferreira. Polynomial time computable arithmetic. Pp. 137–156. - Wilfried Buchholz and Wilfried Sieg. A note on polynomial time computable arithmetic. Pp. 51–55. - Samuel R. Buss. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84. - Gaisi Takeuti. Sharply bounded arithmetic and the function a – 1. Pp. 2. [REVIEW]Jörg Hudelmaier - 1996 - Journal of Symbolic Logic 61 (2):697-699.
- Review: Jean Goubault-Larrecq, Ian Mackie, Proof Theory and Automated Deduction. [REVIEW]Jörg Hudelmaier - 2000 - Bulletin of Symbolic Logic 6 (1):94-95.
- Review: Wilfried Sieg, Logic and Computation, Proceedings of a Workshop held at Carnegie Mellon University, June 30-July 2, 1987. [REVIEW]Jorg Hudelmaier - 1996 - Journal of Symbolic Logic 61 (2):697-699.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-pjbg5 uwo