Full Satisfaction Classes and Recursive Saturation

Canadian Mathematical Bulletin 24 (1):295--97 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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

Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
Expansions, omitting types, and standard systems.Fredrik Engström - 2004 - Dissertation, Chalmers
Construction of Satisfaction Classes for Nonstandard Models.Henryk Kotlarski, Stanislav Krajewski & Alistair H. Lachlan - 1981 - Canadian Mathematical Bulletin 24 (1):283--93.
Full satisfaction classes: a survey.Henryk Kotlarski - 1991 - Notre Dame Journal of Formal Logic 32 (4):573-579.
Inductive Full Satisfaction Classes.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Annals of Pure and Applied Logic 47 (1):199--223.
Game sentences, recursive saturation and definability.Victor Harnik - 1980 - Journal of Symbolic Logic 45 (1):35-46.
Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Transfering saturation, the finite cover property, and stability.John T. Baldwin, Rami Grossberg & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (2):678-684.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Elementary extensions of external classes in a nonstandard universe.Vladimir Kanovei & Michael Reeken - 1998 - Studia Logica 60 (2):253-273.
Function identification from noisy data with recursive error Bounds.Mark Changizi - 1996 - Erkenntnis 45 (1):91 - 102.
Honest Bounds for complexity classes of recursive functions.R. Moll & A. R. Meyer - 1974 - Journal of Symbolic Logic 39 (1):127-138.
Closure properties of almost-finiteness classes in recursive function theory.Heinrich Rolletschek - 1983 - Journal of Symbolic Logic 48 (3):756-763.

Analytics

Added to PP
2011-07-09

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Axiomatic theories of truth.Volker Halbach - 2008 - Stanford Encyclopedia of Philosophy.
Truth is Simple.Leon Horsten & Graham E. Leigh - 2017 - Mind 126 (501):195-232.
How Innocent Is Deflationism?Volker Halbach - 2001 - Synthese 126 (1-2):167-194.

View all 19 citations / Add more citations

References found in this work

No references found.

Add more references