- 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
A rule-completeness theorem
Notre Dame Journal of Formal Logic 4 (1):39-43 (1963)
Abstract
This article has no associated abstract. (fix it)Author Profiles
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
Semantical analysis of predicate logics without the contraction rule.Hiroakira Ono - 1985 - Studia Logica 44 (2):187 - 196.
An analytic completeness theorem for logics with probability quantifiers.Douglas N. Hoover - 1987 - Journal of Symbolic Logic 52 (3):802-816.
Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
Completeness theorems, representation theorems: what's the difference?David C. Makinson - unknown - Hommage À Wlodek: Philosophical Papers Dedicated to Wlodek Rabinowicz, Ed. Rønnow-Rasmussen Et Al. 2007.
A unified completeness theorem for quantified modal logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem.Stephen L. Bloom - 1973 - Notre Dame Journal of Formal Logic 14 (3):408-410.
A conditional defense of plurality rule: generalizing May's theorem in a restricted informational environment.Robert E. Goodin & Christian List - 2006 - American Journal of Political Science 50 (4):940-949.
⊃E is Admissible in “true” relevant arithmetic.Robert K. Meyer - 1998 - Journal of Philosophical Logic 27 (4):327-351.
A new semantics for intuitionistic predicate logic.Yuichi Komori - 1986 - Studia Logica 45 (1):9 - 17.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
Analytics
Added to PP
2010-08-24
Downloads
22 (#690,757)
6 months
2 (#1,232,442)
2010-08-24
Downloads
22 (#690,757)
6 months
2 (#1,232,442)
Historical graph of downloads
Author Profiles
Citations of this work
Valuational semantics of rule derivability.Lloyd Humberstone - 1996 - Journal of Philosophical Logic 25 (5):451 - 461.
Preservation of admissible rules when combining logics.João Rasga, Cristina Sernadas & Amílcar Sernadas - 2016 - Review of Symbolic Logic 9 (4):641-663.
Intuitionistic Logic and Elementary Rules.Lloyd Humberstone & David Makinson - 2011 - Mind 120 (480):1035-1051.
A Landscape of Logics beyond the Deduction Theorem.Bas C. van Fraassen - 2022 - Principia: An International Journal of Epistemology 26 (1):25-38.
Decidability of admissibility: On a problem by Friedman and its solution by Rybakov.Jeroen P. Goudsmit - 2021 - Bulletin of Symbolic Logic 27 (1):1-38.
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-7c76586df8-hc2g5 uwo