Text

A Framework for Priority Arguments

---

This book presents a unifying framework for using priority arguments to prove theorems in computability. Priority arguments provide the most powerful theorem-proving technique in the field, but most of the applications of this technique are ad hoc, masking the unifying principles used in the proofs. The proposed framework presented isolates many of these unifying combinatorial principles and uses them to give shorter and easier-to-follow proofs of computability-theoretic theorems. Standard theorems of priority levels 1, 2, and 3 are chosen to demonstrate the framework's use, with all proofs following the same pattern. The last section features a new example requiring priority at all finite levels. The book will serve as a resource and reference for researchers in logic and computability, helping them to prove theorems in a shorter and more transparent manner.

---

Availability

No copy data

Detail Information

Series Title

Lecture Notes in Logic

Call Number

-

Publisher

: Cambridge University Press., 2010

Collation

-

Language

English

ISBN/ISSN

9780511750779

Classification

NONE

Content Type

text

Media Type

computer

Carrier Type

online resource

Edition

-

Subject(s)

Mathematics,
Applied Logic
Computer Science, Programming Languages
Logic, Categories and Sets,

Specific Detail Info

-

Statement of Responsibility

Manuel Lerman,

Other Information

Cataloger

Arin

Source

-

Validator

-

Digital Object Identifier (DOI)

https://doi.org/10.1017/CBO9780511750779

Journal Volume

-

Journal Issue

-

Subtitle

-

Parallel Title

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment