default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 3
Volume 3, Number 1, 1962
- Guido Küng:
Bibliography of Soviet work in the field of mathematical logic and the foundations of mathematics, from 1917-1957. 1-40 - Eric Foxley:
The determination of all Sheffer functions in 3-valued logic, using a logical computer. 41-50 - Boleslaw Sobocinski:
A contribution to the axiomatization of Lewis' system S5. 51-60 - G. Y. Rainich:
Notes on foundations. II. On Galois connections. 61-63 - Ivo Thomas:
The rule of excision in positive implication. 64
Volume 3, Number 2, 1962
- Thoralf Skolem:
Proof of some theorems on recursively enumerable sets. 65-74 - Shih-Chao Liu:
Four types of general recursive well-orderings. 75-78 - Nuel D. Belnap Jr., Hugues Leblanc:
Intuitionism reconsidered. 79-82 - Ivan Boh:
A study in Burleigh: Tractatus de regulis generalibus consequentiarum. 83-101 - Juliusz Reichbach:
On the connection of the first-order functional calculus with many-valued propositional calculi. 102-107 - Ivo Thomas:
On the infinity of positive logic. 108 - Boleslaw Sobocinski:
A note on the regular and irregular modal systems of Lewis. 109-113 - Robert E. Clay:
A simple proof of functional completeness in many-valued logics based on Łukasiewicz's C and N. 114-117 - Albert A. Mullin:
A note on a weakened Goldbach-like conjecture. 118-119 - Storrs McCall:
A simple decision procedure for one-variable implicational/negation formulae in intuitionist logic. 120-122 - Boleslaw Sobocinski:
On the generalized Brouwerian axioms. 123-128
Volume 3, Number 3, 1962
- Shih-Chao Liu:
Recursive linear orderings and hyperarithmetical functions. 129-132 - S. Summersbee, A. Walters:
Programming the functions of formal logic. 133-141 - A. N. Prior:
Quantification and Ł-modality. 142-147 - Albert A. Mullin:
Some theorems on the structure of mutant sets and their applications to group and ring theories. 148-151 - D. L. Székely:
A theory of translation and transformation of languages. 152-166 - Boleslaw Sobocinski:
A set-theoretical formula equivalent to the axiom of choice. 167-169 - Ivo Thomas:
Finite limitations on Dummet's LC. 170-174 - Otto Bird:
What Pierce means by leading principles. 175-178 - Michael D. Resnik:
A decision procedure for positive implication. 179-186 - Boleslaw Sobocinski:
Six new sets of independent axioms for distributive lattices with O and I. 187-192 - Desmond Paul Henry:
An Anselmian regress. 193-198 - Ivo Thomas:
Solutions of five modal problems of Sobociński. 199-200 - Hugues Leblanc:
Structural rules of inference. 201-205 - Boleslaw Sobocinski:
An axiom-system for {K;N}-propositional calculus related to Simons' axiomatization of S3. 206-208
Volume 3, Number 4, 1962
- Gordon L. Brumm:
The method of possibility-diagrams for testing the validity of certain types of inferences, based on Jevons' logical alphabet. 209-233 - D. L. Székely:
A preliminary report on the theory of unification of sciences and its concept transforming automation. 234-242 - Thomas W. Scharle:
A diagram of the functors of the two-valued propositional calculus. 243-255 - Leo Simons:
A reduction in the number of independent axiom schemata for S4. 256-258 - Frederick James Crosson:
Formal logic and formal ontology in Husserl's phenomenology. 259-269 - Thomas G. McLaughlin:
On an extension of a theorem of Friedberg. 270-273 - Boleslaw Sobocinski:
A note on the generalized continuum hypothesis. I. 274-278 - Boleslaw Sobocinski:
A remark concerning the third theorem about the existence of successors of cardinals. 279-283 - Paula Marie Wilde:
A new condition for a modular lattice. 284-286 - Thomas W. Scharle:
Note to my paper: "A diagram of the functors of the two-valued propositional calculus". 287-288 - Rolf Schock:
A note on subjunctive and counterfactual implication. 289-290
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-31 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
