13629 results in The Journal of Symbolic Logic
Haskell B. Curry. Combinatory logic. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 90–99.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 267
- Print publication:
- August 1967
-
- Article
- Export citation
S. Feferman and R. L. Vaught. The first order properties of products of algebraic systems. Fundamenta mathematicae, vol, 47 (1959), pp. 57–103.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 276
- Print publication:
- August 1967
-
- Article
- Export citation
M. J. Poliferno. Decision algorithms for some functional calculi with modality. Logique et analyse, n.s. vol. 4 (1961), pp. 138–153. - M. J. Poliferno. Correction to a paper on modal logic. Logique et analyse, n.s. vol. 7 (1964), pp. 32–33.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 244-245
- Print publication:
- August 1967
-
- Article
- Export citation
Nicholas Rescher. Definitions of “existence.”Philosophical studies (Minneapolis), vol. 8 (1957), pp. 65–69. - Karel Lambert. Notes on “E!”. Philosophical studies (Minneapolis), vol. 9 (1958), pp. 60–63.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 251
- Print publication:
- August 1967
-
- Article
- Export citation
M. N. Bleicher. Some theorems on vector spaces and the axiom of choice. Fundamenta mathematicae, vol. 54 (1964), pp. 95–107.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 272-273
- Print publication:
- August 1967
-
- Article
- Export citation
Simplicity of recursively enumerable sets
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 162-172
- Print publication:
- August 1967
-
- Article
- Export citation
Leo Simons. A reduction in the number of independent axiom schemata for S4. Notre Dame journal of formal logic, vol. 3 (1962), pp. 256–258. - Bolesław Sobociński. An axiom-system for {K; N}-propositional calculus related to Simons' axiomatization of S3.Notre Dame journal of formal logic, vol. 3 (1962), pp. 206–208.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 245
- Print publication:
- August 1967
-
- Article
- Export citation
A. Nerode. Extensions to isolic integers. Annals of mathematics, ser. 2 vol. 75 (1962), pp. 419–448.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 268-269
- Print publication:
- August 1967
-
- Article
- Export citation
Some theorems on extensions of arithmetic1
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 180-189
- Print publication:
- August 1967
-
- Article
- Export citation
Kurt Schütte. Predicative well-orderings. Formal systems and recursive functions, Proceedings of the Eighth Logic Colloquium, Oxford, July 1963, edited by J. N. Crossley and M. A. E. Dummett, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 280–303. - Kurt Schütte. Eine Grenze fúr die Beweisbarkeit der transfiniten Induktion in der verzweigten Typenlogik. Archiv für mathematische Logik und Grundlagenforschung, vol. 7 (1965), pp. 45–60.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 284-285
- Print publication:
- August 1967
-
- Article
- Export citation
Peter S. Landweber. Three theorems on phrase structure grammars of type 1. Information and control, vol. 6 (1963), pp. 131–136.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 116
- Print publication:
- June 1967
-
- Article
- Export citation
A. H. Lachlan. On a problem of G. E. Sacks. Proceedings of the American Mathematical Society, vol. 16 (1965), pp. 972–979.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 125
- Print publication:
- June 1967
-
- Article
- Export citation
S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and control, vol. 7 (1964), pp. 207–223.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 116-117
- Print publication:
- June 1967
-
- Article
- Export citation
David G. Cantor. On the ambiguity problem of Backus systems. Journal of the Association for Computing Machinery, vol. 9 (1962), pp. 477–479.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 114
- Print publication:
- June 1967
-
- Article
- Export citation
Stig Kanger. A simplified proof method for elementary logic. Computer programming and formal systems, edited by P. Braffort and D. Hirschberg, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1963, pp. 87–94.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 119
- Print publication:
- June 1967
-
- Article
- Export citation
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, vol. 5 (1962), pp. 394–397.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 118
- Print publication:
- June 1967
-
- Article
- Export citation
Intensional models for first degree formulas1
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1-22
- Print publication:
- June 1967
-
- Article
- Export citation
A. Tarski and R. L. Vaught. Elementary (arithmetical) extensions. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 51–55.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 131
- Print publication:
- June 1967
-
- Article
- Export citation
Lawrence Wos, George A. Robinson, and Daniel F. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 536–541.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 117-118
- Print publication:
- June 1967
-
- Article
- Export citation
J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11–13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York1964, pp. 82–90.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 121-122
- Print publication:
- June 1967
-
- Article
- Export citation