default search action
The Journal of Symbolic Logic, Volume 25
Volume 25, Number 1, March 1960
- H. Jerome Keisler:
Theory of Models with Generalized Atomic Formulas. 1-26 - Ronald Harrop:
Concerning Formulas of the Types A ->B V C, A -< (Ex)B(x). 27-32 - Joseph S. Ullian:
Splinters of Recursive Functions. 33-38 - Robert L. Vaught:
Sentences True in All Constructive Models. 39-53 - Theodore Hailperin:
Corrections to a Theory of Restricted Quantification. 54-56 - David Nelson:
Twenty-Fifth Annual Meeting of the Association for Symbolic Logic. 93-96
Volume 25, Number 2, June 1960
- William Craig:
Bases for First-Order Theories and Subtheories. 97-142 - R. B. Angell:
The Sentential Calculus Using Rule of Inference Re. 143 - Nuel Belnap:
Entailment and Relevance. 144-146 - Azriel Levy:
A Generalization of Godel's Notion of Constructibility. 147-155
Volume 25, Number 3, September 1960
- L. Jonathan Cohen:
A Formalisation of Referentially Opaque Contexts. 193-202 - Arto Salomaa:
A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set. 203-208 - Alan Rose:
An Extension of a Theorem of Margaris. 209-211 - Joseph D. Rutledge:
On the Definition of an Infinitely-Many-Valued Predicate Calculus. 212-216 - Sherman K. Stein:
Full Classes and Ordinals. 217-219 - Hilary Putnam:
An Unsolvable Problem in Number Theory. 220-232 - Joseph R. Shoenfield:
Degrees of Models. 233-237 - Hugues Leblanc:
On Requirements for Conditional Probability Functions. 238-242
Volume 25, Number 4, December 1960
- Kurt Schütte:
Syntactical and Semantical Properties of Simple Type Theory. 305-326 - Iwao Nishimura:
On Formulas of One Variable in Intuitionistic Propositional Calculus. 327-331 - Nuel Belnap:
Twenty-Sixth Annual Meeting of the Association for Symbolic Logic. 384-393
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.