- 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
Weaker D-Complete Logics
Logic Journal of the IGPL 4 (2):215-225 (1996)
Abstract
BB′IW logic (or T→ is known to be D-complete. This paper shows that there are infinitely many weaker D-complete logics and it also examines how certain D-incomplete logics can be made complete by altering their axioms using simple substitutionsOther 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
D-complete Single Axioms for the Equivalential Calculus with the rules D and R.Marcin Czakon - 2024 - Bulletin of the Section of Logic 53 (4):479-489.
Completeness of implicational relevant logics.R. Kashima - 2000 - Logic Journal of the IGPL 8 (6):761-785.
Hybrid logics of separation axioms.Dmitry Sustretov - 2009 - Journal of Logic, Language and Information 18 (4):541-558.
Completeness of intermediate logics with doubly negated axioms.Mohammad Ardeshir & S. Mojtaba Mojtahedi - 2014 - Mathematical Logic Quarterly 60 (1-2):6-11.
On some Kripke complete and Kripke incomplete intermediate predicate logics.Dmitrij Skvortsov - 1998 - Studia Logica 61 (2):281-292.
A simple incomplete extension of T which is the union of two complete modal logics with F.m.P.Roy A. Benton - 2002 - Journal of Philosophical Logic 31 (6):527-541.
All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.Tadeusz Litak & Frank Wolter - 2005 - Studia Logica 81 (2):153-165.
Structural Completeness and Superintuitionistic Inquisitive Logics.Thomas Ferguson & Vít Punčochář - 2023 - In Helle Hvid Hansen, Andre Scedrov & Ruy J. G. B. De Queiroz (eds.), Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023, Proceedings. Springer Nature Switzerland. pp. 194-210.
Analytics
Added to PP
2015-02-04
Downloads
23 (#949,443)
6 months
4 (#1,269,568)
2015-02-04
Downloads
23 (#949,443)
6 months
4 (#1,269,568)
Historical graph of downloads
Citations of this work
A Finitely Axiomatized Formalization of Predicate Calculus with Equality.Norman D. Megill - 1995 - Notre Dame Journal of Formal Logic 36 (3):435-453.
References found in this work
Calculi of Pure Strict Implication.E. J. Lemon, C. A. Meredith, D. Meredith, A. N. Prior & I. Thomas - 1958 - Studia Logica 8:331-333.
Principal type-schemes and condensed detachment.J. Roger Hindley & David Meredith - 1990 - Journal of Symbolic Logic 55 (1):90-105.
A simplified form of condensed detachment.M. W. Bunder - 1995 - Journal of Logic, Language and Information 4 (2):169-173.
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-648784bb4d-82spv uwo