Non-Deterministic Inductive Definitions and Fullness

In Peter Schuster & Dieter Probst, 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)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,343

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.
Proof-Oriented Categorical Semantics.Marco Benini - 2016 - In Peter Schuster & Dieter Probst, Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 41-68.
Introduction.Peter Schuster & Dieter Probst - 2016 - In Peter Schuster & Dieter Probst, Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 1-4.
Contents.Peter Schuster & Dieter Probst - 2016 - In Peter Schuster & Dieter Probst, Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter.
On Sets of Premises.Kosta Došen - 2016 - In Peter Schuster & Dieter Probst, Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 151-162.

Analytics

Added to PP
2016-07-30

Downloads
37 (#640,129)

6 months
5 (#702,808)

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