Non-Deterministic Inductive Definitions and Fullness

In Peter Schuster & Dieter Probst (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 163-170 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

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

Through your library

Similar books and articles

Non-deterministic inductive definitions.Benno van den Berg - 2013 - Archive for Mathematical Logic 52 (1-2):113-135.
Ordinal analysis of non-monotone-definable inductive definitions.Wolfram Pohlers - 2008 - Annals of Pure and Applied Logic 156 (1):160-169.
A note on theories for quasi-inductive definitions.Riccardo Bruni - 2009 - Review of Symbolic Logic 2 (4):684-699.
Quantifiers, games and inductive definitions.Peter Aczel - 1975 - Journal of Symbolic Logic 82 (2):1--14.
Functional interpretation and inductive definitions.Jeremy Avigad & Henry Towsner - 2009 - Journal of Symbolic Logic 74 (4):1100-1120.
On constructing completions.Laura Crosilla, Hajime Ishihara & Peter Schuster - 2005 - Journal of Symbolic Logic 70 (3):969-978.
Refinement is equivalent to Fullness.Albert Ziegler - 2010 - Mathematical Logic Quarterly 56 (6):666-669.
Global inductive definability.Jon Barwise & Yiannis N. Moschovakis - 1978 - Journal of Symbolic Logic 43 (3):521-534.

Analytics

Added to PP
2016-07-30

Downloads
12 (#929,749)

6 months
1 (#1,042,085)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references