A Metatheorem for Finite-Injury Priority Arguments

Grzegorz J Michalski

A Metatheorem for Finite-Injury Priority Arguments

Grzegorz J Michalski

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

 The paper presents a theorem which seems to capture essential combinatorial features common to all known finite-injury priority arguments in recursion theory and recursive model theory. In this sense the theorem can serve as a metatheorem for all such arguments, providing a general framework for them.
 
 There are similar metatheorems of Ash and Knight (cf [1], [2], [3]) designed to do complicated a-nested priority arguments--they do not however apply to the classical Friedberg-Muchnik theorem. The statement of our metatheorem is as follows ...

Original language	American English
State	Published - Mar 30 1995
Event	Association for Symbolic Logic Annual Meeting (ASL) - Madison, WI Duration: Mar 9 1996 → …

Conference

Conference	Association for Symbolic Logic Annual Meeting (ASL)
Period	03/9/96 → …

Keywords

Finite-injury
Metatheorem
Priority arguments

DC Disciplines

Mathematics

Cite this

@conference{1768ed0e36e14df7882661e52bcfadc3,

title = "A Metatheorem for Finite-Injury Priority Arguments",

abstract = " The paper presents a theorem which seems to capture essential combinatorial features common to all known finite-injury priority arguments in recursion theory and recursive model theory. In this sense the theorem can serve as a metatheorem for all such arguments, providing a general framework for them. There are similar metatheorems of Ash and Knight (cf [1], [2], [3]) designed to do complicated a-nested priority arguments--they do not however apply to the classical Friedberg-Muchnik theorem. The statement of our metatheorem is as follows ...",

keywords = "Finite-injury, Metatheorem, Priority arguments",

author = "Michalski, {Grzegorz J}",

note = "1994-1995 Annual Meeting of the Association for Symbolic Logic, The Bulletin of Symbolic Logic, Vol. 1, No. 3 (Sep., 1995), pp. 377-389; Association for Symbolic Logic Annual Meeting (ASL) ; Conference date: 09-03-1996",

year = "1995",

month = mar,

day = "30",

language = "American English",

}

TY - CONF

T1 - A Metatheorem for Finite-Injury Priority Arguments

AU - Michalski, Grzegorz J

N1 - 1994-1995 Annual Meeting of the Association for Symbolic Logic, The Bulletin of Symbolic Logic, Vol. 1, No. 3 (Sep., 1995), pp. 377-389

PY - 1995/3/30

Y1 - 1995/3/30

N2 - The paper presents a theorem which seems to capture essential combinatorial features common to all known finite-injury priority arguments in recursion theory and recursive model theory. In this sense the theorem can serve as a metatheorem for all such arguments, providing a general framework for them. There are similar metatheorems of Ash and Knight (cf [1], [2], [3]) designed to do complicated a-nested priority arguments--they do not however apply to the classical Friedberg-Muchnik theorem. The statement of our metatheorem is as follows ...

AB - The paper presents a theorem which seems to capture essential combinatorial features common to all known finite-injury priority arguments in recursion theory and recursive model theory. In this sense the theorem can serve as a metatheorem for all such arguments, providing a general framework for them. There are similar metatheorems of Ash and Knight (cf [1], [2], [3]) designed to do complicated a-nested priority arguments--they do not however apply to the classical Friedberg-Muchnik theorem. The statement of our metatheorem is as follows ...

KW - Finite-injury

KW - Metatheorem

KW - Priority arguments

UR - http://www.jstor.org/stable/421165

M3 - Presentation

T2 - Association for Symbolic Logic Annual Meeting (ASL)

Y2 - 9 March 1996

ER -

A Metatheorem for Finite-Injury Priority Arguments

Abstract

Conference

Keywords

DC Disciplines

Other files and links

Fingerprint

Cite this