Completeness and persistence in the theory of models

Mathematical Logic Quarterly 2 (1‐4):15-26 (1956)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19560020103

Links

PhilArchive



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

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: Abraham Robinson, Completeness and Persistence in the Theory of Models. [REVIEW]W. Peremans - 1960 - Journal of Symbolic Logic 25 (2):170-171.
Basic logic, k4, and persistence.Wim Ruitenburg - 1999 - Studia Logica 63 (3):343-352.
Can Persistence be a Matter of Convention?Tobias Hansson Wahlberg - 2011 - Axiomathes 21 (4):507-529.
Four-Dimensionalist Theories of Persistence.Sarah Moss - 2012 - Australasian Journal of Philosophy 90 (4):671-686.
Two applications of Boolean models.Thierry Coquand - 1998 - Archive for Mathematical Logic 37 (3):143-147.
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free.Murdoch J. Gabbay - 2012 - Journal of Symbolic Logic 77 (3):828-852.
On Models Constructed by Means of the Arithmetized Completeness Theorem.Richard Kaye & Henryk Kotlarski - 2000 - Mathematical Logic Quarterly 46 (4):505-516.
Syntax and Semantics of the Logic.Carsten Butz - 1997 - Notre Dame Journal of Formal Logic 38 (3):374-384.
Completeness theorem for propositional probabilistic models whose measures have only finite ranges.Radosav Dordević, Miodrag Rašković & Zoran Ognjanović - 2004 - Archive for Mathematical Logic 43 (4):557-563.
Completeness: from Gödel to Henkin.Maria Manzano & Enrique Alonso - 2014 - History and Philosophy of Logic 35 (1):1-26.
Intuitionistic completeness for first order classical logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
What makes a theory physically “complete”?Andrew Elby, Harvey R. Brown & Sara Foster - 1993 - Foundations of Physics 23 (7):971-985.
Intensional models for the theory of types.Reinhard Muskens - 2007 - Journal of Symbolic Logic 72 (1):98-118.
Completeness and incompleteness for plausibility logic.Karl Schlechta - 1996 - Journal of Logic, Language and Information 5 (2):177-192.
Finite models constructed from canonical formulas.Lawrence S. Moss - 2007 - Journal of Philosophical Logic 36 (6):605 - 640.

Analytics

Added to PP
2013-11-24

Downloads
18 (#827,632)

6 months
2 (#1,187,206)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Graphschemata und rekursive funktionen.von Rózsa Péter - 1958 - Dialectica 12 (3‐4):373-393.

Add more citations

References found in this work

On predicates in algebraically closed fields.Abraham Robinson - 1954 - Journal of Symbolic Logic 19 (2):103-114.

Add more references