- 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
Concerning formulas of the types a →b ∨c, a →(ex)b(X)
Journal of Symbolic Logic 25 (1):27-32 (1960)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Harrop Ronald. Concerning formulas of the types A → B v C, A → B in intuitionistic formal systems. [REVIEW]T. Thacher Robinson - 1962 - Journal of Symbolic Logic 27 (1):110-111.
Review: Ronald Harrop, Concerning Formulas of the Types $A rightarrow B mathbf{v} C, A rightarrow (Ex) B(x)$ in Intuitionistic Formal Systems. [REVIEW]T. Thacher Robinson - 1962 - Journal of Symbolic Logic 27 (1):110-111.
Concerning Formulas of the Types A → B v C, A → B in Intuitionistic Formal Systems.T. Thacher Robinson - 1962 - Journal of Symbolic Logic 27 (1):110-111.
The "Relevance" of Intersection and Union Types.Mariangiola Dezani-Ciancaglini, Silvia Ghilezan & Betti Venneri - 1997 - Notre Dame Journal of Formal Logic 38 (2):246-269.
An Omitting Types Theorem for Sheaves over Topological Spaces.Andreas Brunner & Francisco Miraglia - 2004 - Logic Journal of the IGPL 12 (6):525-548.
Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic.P. Miglioli, U. Moscato & M. Ornaghi - 1997 - Logic Journal of the IGPL 5 (1):145-167.
Finite Sets and Natural Numbers in Intuitionistic TT.Daniel Dzierzgowski - 1996 - Notre Dame Journal of Formal Logic 37 (4):585-601.
Extendible Formulas in Two Variables in Intuitionistic Logic.Nick Bezhanishvili & Dick Jongh - 2012 - Studia Logica 100 (1-2):61-89.
Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic.Saeed Salehi - 2002 - Reports on Mathematical Logic 36 (1):55-61.
A proof-theoretical analysis of semiconstructive intermediate theories.Mauro Ferrari & Camillo Fiorentini - 2003 - Studia Logica 73 (1):21 - 49.
Intuitionistic Completeness and Classical Logic.D. C. McCarty - 2002 - Notre Dame Journal of Formal Logic 43 (4):243-248.
On Some Semi-Intuitionistic Logics.Juan M. Cornejo & Ignacio D. Viglizzo - 2015 - Studia Logica 103 (2):303-344.
Intuitionistic Predicate Logic with Decidable Propositional Formulas.Alexander Sakharov - 2007 - Reports on Mathematical Logic.
An application of the Rieger-Nishimura formulas to the intuitionistic modal logics.Dimiter Vakarelov - 1984 - Bulletin of the Section of Logic 13 (3):120-122.
Analytics
Added to PP
2009-01-28
Downloads
43 (#352,595)
6 months
8 (#292,366)
2009-01-28
Downloads
43 (#352,595)
6 months
8 (#292,366)
Historical graph of downloads
Citations of this work
Incompleteness of Intuitionistic Propositional Logic with Respect to Proof-Theoretic Semantics.Thomas Piecha & Peter Schroeder-Heister - 2019 - Studia Logica 107 (1):233-246.
Uniform proofs as a foundation for logic programming.Dale Miller, Gopalan Nadathur, Frank Pfenning & Andre Scedrov - 1991 - Annals of Pure and Applied Logic 51 (1-2):125-157.
Hereditarily structurally complete positive logics.Alex Citkin - 2020 - Review of Symbolic Logic 13 (3):483-502.
References found in this work
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