Global inductive definability

Journal of Symbolic Logic 43 (3):521-534 (1978)
  Copy   BIBTEX

Abstract

We show that several theorems on ordinal bounds in different parts of logic are simple consequences of a basic result in the theory of global inductive definitions

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
78 (#208,853)

6 months
10 (#257,583)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On branching quantifiers in English.Jon Barwise - 1979 - Journal of Philosophical Logic 8 (1):47 - 80.
Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.
Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
1998 European Summer Meeting of the Association for Symbolic Logic.S. Buss - 1999 - Bulletin of Symbolic Logic 5 (1):59-153.
A progression semantics for first-order logic programs.Yi Zhou & Yan Zhang - 2017 - Artificial Intelligence 250 (C):58-79.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Axioms for abstract model theory.K. Jon Barwise - 1974 - Annals of Mathematical Logic 7 (2-3):221-265.
Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.
Axioms for abstract model theory.K. J. Barwise - 1974 - Annals of Mathematical Logic 7 (2-3):221-265.

Add more references