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)

Other Versions

No versions found

Links

PhilArchive

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

Similar books and articles

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.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.

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

Classical Determinate Truth I.Kentaro Fujimoto & Volker Halbach - 2024 - Journal of Symbolic Logic 89 (1):218-261.
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.
Axiomatische Wahrheitstheorien.Volker Halbach - 1996 - Berlin, Boston: De Gruyter.

View all 24 citations / Add more citations

References found in this work

No references found.

Add more references