Logic with denumerably long formulas and finite strings of quantifiers

Journal of Symbolic Logic 36 (1):1104--329 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271545

Other Versions

edition Scott, Dana; Addison, J. W.; Henkin, Leon; Tarski, Alfred (1971) "Logic with Denumerably Long Formulas and Finite Strings of Quantifiers". Journal of Symbolic Logic 36(1):157-158

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,676

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Scott Dana. Logic with denumerably long formulas and finite strings of quantifiers. The theory of models, Proceedings of the 1963 International Symposium at Berkeley, edited by Addison J. W., Henkin Leon, and Tarski Alfred, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 329–341. [REVIEW]Perry Smith - 1971 - Journal of Symbolic Logic 36 (1):157-158.
On the model theory of denumerably long formulas with finite strings of quantifiers.M. Makkai - 1969 - Journal of Symbolic Logic 34 (3):437-459.
M. Makkai. On the model theory of denumerably long formulas with finite strings of quantifiers. The journal of symbolic logic, vol. 34 , pp. 437–459. [REVIEW]H. Jerome Keisler - 1973 - Journal of Symbolic Logic 38 (2):337-337.
The Skolemization of existential quantifiers in intuitionistic logic.Matthias Baaz & Rosalie Iemhoff - 2006 - Annals of Pure and Applied Logic 142 (1):269-295.
Review: Dana Scott, Alfred Tarski, The Sentential Calculus with Infinitely Long Expressions. [REVIEW]Thomas Frayne - 1965 - Journal of Symbolic Logic 30 (1):95-95.
Finite Approximations of Infinitely Long Formulas.H. Jerome Keisler, J. W. Addison, Leon Henkin & Alfred Tarski - 1969 - Journal of Symbolic Logic 34 (1):129-130.

Analytics

Added to PP
2014-02-01

Downloads
83 (#251,317)

6 months
9 (#471,468)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

De finetti, countable additivity, consistency and coherence.Colin Howson - 2008 - British Journal for the Philosophy of Science 59 (1):1-23.
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
A new approach to infinitary languages.J. Hintikka - 1976 - Annals of Mathematical Logic 10 (1):95.
Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.

View all 27 citations / Add more citations

References found in this work

No references found.

Add more references