default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 33
Volume 33, Number 1, March 1968
- Richmond H. Thomason:
On the Strong Semantical Completeness of the Intuitionistic Predicate Calculus. 1-7 - Robert K. Meyer, Karel Lambert:
Universally Free Logic and Standard Quantification Theory. 8-26 - R. A. Bull:
An Algebraic Study of Tense Logics with Linear Time. 27-38 - George Goe:
Modifications of Quine's ML and Inclusive Quantification Systems. 39-42 - Wayne Richter:
Constructively Accessible Ordinal Numbers. 43-55 - Marian Boykan Pour-El:
Effectively Extensible Theories. 56-68 - Jens Erik Fenstad:
On the Completeness of Some Transfinite Recursive Progressions of Axiomatic Theories. 69-76 - Witold A. Pogorzelski:
On the Scope of the Classical Deduction Theorem. 77-81 - Richard Routley, Hugh Alexander Montgomery:
On Systems Containing Aristotle's Thesis. 82-96 - J. Jay Zeman:
Some Calculi with Strong Negation Primitive. 97-100 - Eugene W. Madison:
Structures Elementarily Closed Relative to a Model for Arithmetic. 101-104 - James Rosenberg:
Functional Completeness in One Variable. 105-106 - Frederic Brenton Fitch:
A Note on Recursive Relations. 107 - Richard L. Call:
A Minimal Canonically Complete M-Valued Proper Logic for Each M. 108-110
Volume 33, Number 2, June 1968
- Hugues LeBlanc:
Subformula Theorems for N-Sequents. 161-179 - Peter B. Andrews:
On Simplifying the Matrix of a WFF. 180-192 - Solomon Feferman:
Systems of Predicative Analysis, II: Representations of Ordinals. 193-220 - Don C. Ferguson:
Infinite Products of Recursive Equivalence Types. 221-230 - Hugues LeBlanc:
A Simplified Account of Validity and Implication for Quantificational Logic. 231-235 - James R. Geiser:
Nonstandard Logic. 236-250 - Robert E. Clay:
The Consistency of Lesniewski's Mereology Relative to the Real Number System. 251-257 - C. G. McKay:
The Decidability of Certain Intermediate Propositional Logics. 258-264 - T. Thacher Robinson:
Independence of Two Nice Sets of Axioms for the Propositional Calculus. 265-270 - Arnold Oberschelp:
On the Craig-Lyndon Interpolation Theorem. 271-274 - Hugues LeBlanc:
On Meyer and Lambert's Quantificational Calculus FQ. 275-280
Volume 33, Number 3, September 1968
- Georg Kreisel:
A Survey of Proof Theory. 321-388 - Graham C. Driscoll Jr.:
Metarecursively Enumerable Sets and Their Metadegrees. 389-411 - Dirk van Dalen:
Reducibilities in Intuitionistic Topology. 412-417 - Dennis F. Cudia, Wilson E. Singletary:
The Post Correspondence Problem. 418-430 - Alistair H. Lachlan:
Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets. 431-443 - M. K. Rennie:
S3(S) = S3.5. 444-445 - Kenneth Kunen:
Implicit Definability and Infinitary Languages. 446-451 - Dag Prawitz:
Hauptsatz for Higher Order Logic. 452-457 - J. Jay Zeman:
Lemmon-Style Bases for the Systems S1 ring- S4ring . 458-461 - J. Jay Zeman:
The Semisubstitutivity of Strict Implication. 462-464 - M. H. Lob, F. R. Drake, John Derrick:
Meeting of the Association for Symbolic Logic Leeds 1967. 490
Volume 33, Number 4, December 1968
- George Boolos, Hilary Putnam:
Degrees of Unsolvability of Constructible Sets of Integers. 497-513 - Daniel Richardson:
Some Undecidable Problems Involving Elementary Functions of a Real Variable. 514-520 - Carl G. Jockusch Jr.:
Uniformly Introreducible Sets. 521-536 - Nicholas Rescher, James W. Garson:
Topological Logic. 537-548 - Raymond M. Smullyan:
Uniform Gentzen Systems. 549-559 - Raymond M. Smullyan:
Analytic Cut. 560-564 - Alan G. Hamilton:
An Unsolved Problem in the Theory of Constructive Order Types. 565-567 - Richard Routley, Hugh Alexander Montgomery:
The Inadequacy of Kripke's Semantical Analysis of D2 and D3. 568 - Ivo Thomas:
Replacement in Some Modal Systems. 569-570 - Per Lindström:
Remarks on Some Theorems of Keisler. 571-576 - W. M. Lambert Jr.:
A Notion of Effectiveness in Arbitrary Structures. 577-602 - Burton Dreben, James Thomson:
Annual Meeting of the Association for Symbolic Logic. 636-645
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-10 18:35 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:
