Finite Approximations of Infinitely Long Formulas

, , &
Journal of Symbolic Logic 34 (1):129-130 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271019

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

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

Review: H. Jerome Keisler, J. W. Addison, Leon Henkin, Alfred Tarski, Finite Approximations of Infinitely Long Formulas; H. Jerome Keisler, Some Applications of Infinitely Long Formulas. [REVIEW]Carol Karp - 1969 - Journal of Symbolic Logic 34 (1):129-130.
Review: Dana Scott, J. W. Addison, Leon Henkin, Alfred Tarski, Logic with Denumerably Long Formulas and Finite Strings of Quantifiers. [REVIEW]Perry Smith - 1971 - Journal of Symbolic Logic 36 (1):157-158.
Review: L. Henkin, Some Remarks on Infinitely Long Formulas; Carol R. Karp, Independence Proofs in Predicate Logic with Infinitely Long Expressions. [REVIEW]Thomas Frayne - 1965 - Journal of Symbolic Logic 30 (1):96-97.
Some applications of infinitely long formulas.H. Jerome Keisler - 1965 - Journal of Symbolic Logic 30 (3):339-349.
Generalized algebras of Post and their applications to infinitely many-valued logics with infinitely long formulas.Nguen Cat-ho - 1972 - Bulletin of the Section of Logic 1 (1):4-12.
Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
On Finite Approximations of Topological Algebraic Systems.L. Yu Glebsky, E. I. Gordon & C. Ward Hensen - 2007 - Journal of Symbolic Logic 72 (1):1 - 25.
Characteristic Formulas of Partial Heyting Algebras.Alex Citkin - 2013 - Logica Universalis 7 (2):167-193.
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (6):1201-1241.
Infinite Idealizations.John D. Norton - 2012 - Vienna Circle Institute Yearbook 17:197-210.
Infinitely Complex Machines.Eric Steinhart - 2007 - In Intelligent Computing Everywhere. Springer. pp. 25-43.
Local-Global Properties of Positive Primitive Formulas in the Theory of Spaces of Orderings.M. Marshall - 2006 - Journal of Symbolic Logic 71 (4):1097 - 1107.
On the model theory of denumerably long formulas with finite strings of quantifiers.M. Makkai - 1969 - Journal of Symbolic Logic 34 (3):437-459.
Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
Axiom systems for first order logic with finitely many variables.James S. Johnson - 1973 - Journal of Symbolic Logic 38 (4):576-578.

Analytics

Added to PP
2015-02-05

Downloads
20 (#764,377)

6 months
7 (#421,763)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Local definability theory.Gonzalo E. Reyes - 1970 - Annals of Mathematical Logic 1 (1):95-137.
Game sentences and ultrapowers.Renling Jin & H. Jerome Keisler - 1993 - Annals of Pure and Applied Logic 60 (3):261-274.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references