- 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
On propositional quantifiers in provability logic
Notre Dame Journal of Formal Logic 34 (3):401-419 (1993)
Abstract
This article has no associated abstract. (fix it)Author Profiles
Other Versions
No versions found
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
Review: Sergei N. Artemov, Explicit Provability and Constructive Semantics. [REVIEW]Jeremy D. Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):432-433.
On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.D. Bollman & M. Tapia - 1972 - Notre Dame Journal of Formal Logic 13 (1):124-128.
The predicate modal logic of provability.Franco Montagna - 1984 - Notre Dame Journal of Formal Logic 25 (2):179-189.
The modal logic of pure provability.Samuel R. Buss - 1990 - Notre Dame Journal of Formal Logic 31 (2):225-231.
Characters and fixed-points in provability logic.Zachary Gleit & Warren Goldfarb - 1989 - Notre Dame Journal of Formal Logic 31 (1):26-36.
Explicit modal logic, informal provability and Montague's Paradox.W. Dean - forthcoming - Notre Dame Journal of Formal Logic.
A new proof of the fixed-point theorem of provability logic.Lisa Reidhaar-Olson - 1989 - Notre Dame Journal of Formal Logic 31 (1):37-43.
Algebraic logic with generalized quantifiers.Charles C. Pinter - 1975 - Notre Dame Journal of Formal Logic 16 (4):511-516.
An axiom - system for {"K;N"} - propositional calculus related to Simons' axiomatization of S3.Bolesław Sobociński - 1962 - Notre Dame Journal of Formal Logic 3:206.
Introduction.Zoé Chatzidakis, David Marker, Amador Martin-Pizarro, Rahim Moosa & Sergei Starchenko - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):277-277.
Analytics
Added to PP
2010-08-24
Downloads
81 (#267,397)
6 months
5 (#702,808)
2010-08-24
Downloads
81 (#267,397)
6 months
5 (#702,808)
Historical graph of downloads
Author Profiles
Citations of this work
Second-order propositional modal logic and monadic alternation hierarchies.Antti Kuusisto - 2015 - Annals of Pure and Applied Logic 166 (1):1-28.
Undecidability in diagonalizable algebras.V. Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
Franco Montagna’s Work on Provability Logic and Many-valued Logic.Lev Beklemishev & Tommaso Flaminio - 2016 - Studia Logica 104 (1):1-46.
References found in this work
Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
Provability Interpretations of Modal Logic.Robert M. Solovay - 1981 - Journal of Symbolic Logic 46 (3):661-662.
Transfinite Recursive Progressions of Axiomatic Theories.Solomon Feferman - 1967 - Journal of Symbolic Logic 32 (4):530-531.
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic.Albert Visser - 1984 - Journal of Philosophical Logic 13 (1):97 - 113.
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-99fc7d78b-s277s uwo