- 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
The strength of admissibility without foundation
Journal of Symbolic Logic 49 (3):867-879 (1984)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Admissibility of structural rules for contraction-free systems of intuitionistic logic.Roy Dyckhoff & Sara Negri - 2000 - Journal of Symbolic Logic 65 (4):1499-1518.
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property.Vladimir V. Rybakov - 1994 - Studia Logica 53 (2):203 - 225.
Some theories with positive induction of ordinal strength ϕω.Gerhard Jäger & Thomas Strahm - 1996 - Journal of Symbolic Logic 61 (3):818-842.
Negotiating from strength and the concept of bargaining strength.S. S. Komorita - 1977 - Journal for the Theory of Social Behaviour 7 (1):65–79.
The regulatory strength: How to be precise about regulation and homeostasis.Daniel Kahn & Hans V. Westerhoff - 1993 - Acta Biotheoretica 41 (1-2):85-96.
Common reasoning about admissibility.Cristina Bicchieri & Oliver Schulte - 1996 - Erkenntnis 45 (2-3):299 - 325.
Analytics
Added to PP
2009-01-28
Downloads
19 (#794,398)
6 months
8 (#351,492)
2009-01-28
Downloads
19 (#794,398)
6 months
8 (#351,492)
Historical graph of downloads
Citations of this work
Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.
Reflections on reflections in explicit mathematics.Gerhard Jäger & Thomas Strahm - 2005 - Annals of Pure and Applied Logic 136 (1-2):116-133.
A new model construction by making a detour via intuitionistic theories IV: A closer connection between KPω and BI.Kentaro Sato - 2024 - Annals of Pure and Applied Logic 175 (7):103422.
Universes over Frege structures.Reinhard Kahle - 2003 - Annals of Pure and Applied Logic 119 (1-3):191-223.
The [mathematical formula] quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals.Markus Marzetta & Thomas Strahm - 1997 - Archive for Mathematical Logic 36 (6):391-413.
References found in this work
A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
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-55b469568f-znn98 uwo